60 lines
2.2 KiB
BibTeX
60 lines
2.2 KiB
BibTeX
|
|
@inproceedings{vygen_fptas_2024,
|
|
address = {Cham},
|
|
title = {An {FPTAS} for {Connectivity} {Interdiction}},
|
|
volume = {14679},
|
|
isbn = {978-3-031-59834-0 978-3-031-59835-7},
|
|
url = {https://link.springer.com/10.1007/978-3-031-59835-7_16},
|
|
language = {en},
|
|
urldate = {2024-11-04},
|
|
booktitle = {Integer {Programming} and {Combinatorial} {Optimization}},
|
|
publisher = {Springer Nature Switzerland},
|
|
author = {Huang, Chien-Chung and Obscura Acosta, Nidia and Yingchareonthawornchai, Sorrachai},
|
|
editor = {Vygen, Jens and Byrka, Jarosław},
|
|
year = {2024},
|
|
doi = {10.1007/978-3-031-59835-7_16},
|
|
pages = {210--223},
|
|
}
|
|
|
|
@article{chalermsook_approximating_2022,
|
|
title = {Approximating k-{Edge}-{Connected} {Spanning} {Subgraphs} via a {Near}-{Linear} {Time} {LP} {Solver}},
|
|
volume = {229},
|
|
copyright = {Creative Commons Attribution 4.0 International license, info:eu-repo/semantics/openAccess},
|
|
issn = {1868-8969},
|
|
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.37},
|
|
doi = {10.4230/LIPICS.ICALP.2022.37},
|
|
language = {en},
|
|
urldate = {2025-03-09},
|
|
journal = {LIPIcs, Volume 229, ICALP 2022},
|
|
author = {Chalermsook, Parinya and Huang, Chien-Chung and Nanongkai, Danupon and Saranurak, Thatchaphol and Sukprasert, Pattara and Yingchareonthawornchai, Sorrachai},
|
|
editor = {Bojańczyk, Mikołaj and Merelli, Emanuela and Woodruff, David P.},
|
|
year = {2022},
|
|
keywords = {Approximation Algorithms, Data Structures, Theory of computation → Routing and network design problems},
|
|
pages = {37:1--37:20},
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
@article{garg_faster_nodate,
|
|
author = {Garg, Naveen and K\"{o}nemann, Jochen},
|
|
title = {Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems},
|
|
journal = {SIAM Journal on Computing},
|
|
volume = {37},
|
|
number = {2},
|
|
pages = {630-652},
|
|
year = {2007},
|
|
doi = {10.1137/S0097539704446232},
|
|
URL = { https://doi.org/10.1137/S0097539704446232},
|
|
eprint = {https://doi.org/10.1137/S0097539704446232},
|
|
abstract = { This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new, faster, and much simpler algorithms for these problems. }
|
|
}
|
|
|
|
|
|
|
|
|