This commit is contained in:
193
ref.bib
193
ref.bib
@@ -1,113 +1,104 @@
|
||||
|
||||
@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},
|
||||
@inproceedings{huang_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\l{}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},
|
||||
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\'{n}czyk, Miko\l{}aj and Merelli, Emanuela and Woodruff, David P.},
|
||||
year = {2022},
|
||||
keywords = {Approximation Algorithms, Data Structures, Theory of computation \rightarrow{} 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. }
|
||||
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.}
|
||||
}
|
||||
|
||||
@article{cunningham_optimal_1985,
|
||||
title = {Optimal attack and reinforcement of a network},
|
||||
volume = {32},
|
||||
issn = {0004-5411, 1557-735X},
|
||||
url = {https://dl.acm.org/doi/10.1145/3828.3829},
|
||||
doi = {10.1145/3828.3829},
|
||||
language = {en},
|
||||
number = {3},
|
||||
urldate = {2025-04-11},
|
||||
journal = {Journal of the ACM},
|
||||
author = {Cunningham, William H.},
|
||||
month = jul,
|
||||
year = {1985},
|
||||
pages = {549--561},
|
||||
title = {Optimal attack and reinforcement of a network},
|
||||
volume = {32},
|
||||
issn = {0004-5411, 1557-735X},
|
||||
url = {https://dl.acm.org/doi/10.1145/3828.3829},
|
||||
doi = {10.1145/3828.3829},
|
||||
language = {en},
|
||||
number = {3},
|
||||
urldate = {2025-04-11},
|
||||
journal = {Journal of the ACM},
|
||||
author = {Cunningham, William H.},
|
||||
month = jul,
|
||||
year = {1985},
|
||||
pages = {549--561}
|
||||
}
|
||||
|
||||
|
||||
@article{chekuri_lp_2020,
|
||||
title = {{LP} {Relaxation} and {Tree} {Packing} for {Minimum} $k$-{Cut}},
|
||||
volume = {34},
|
||||
issn = {0895-4801, 1095-7146},
|
||||
url = {https://epubs.siam.org/doi/10.1137/19M1299359},
|
||||
doi = {10.1137/19M1299359},
|
||||
language = {en},
|
||||
number = {2},
|
||||
urldate = {2022-04-10},
|
||||
journal = {SIAM Journal on Discrete Mathematics},
|
||||
author = {Chekuri, Chandra and Quanrud, Kent and Xu, Chao},
|
||||
month = jan,
|
||||
year = {2020},
|
||||
keywords = {Approximation, K-cut, Minimum cut, Tree packing},
|
||||
pages = {1334--1353},
|
||||
title = {{LP} {Relaxation} and {Tree} {Packing} for {Minimum} $k$-{Cut}},
|
||||
volume = {34},
|
||||
issn = {0895-4801, 1095-7146},
|
||||
url = {https://epubs.siam.org/doi/10.1137/19M1299359},
|
||||
doi = {10.1137/19M1299359},
|
||||
language = {en},
|
||||
number = {2},
|
||||
urldate = {2022-04-10},
|
||||
journal = {SIAM Journal on Discrete Mathematics},
|
||||
author = {Chekuri, Chandra and Quanrud, Kent and Xu, Chao},
|
||||
month = jan,
|
||||
year = {2020},
|
||||
keywords = {Approximation, K-cut, Minimum cut, Tree packing},
|
||||
pages = {1334--1353}
|
||||
}
|
||||
|
||||
@inproceedings{10.1145/3618260.3649730,
|
||||
author = {Chen, Lin and Lian, Jiayi and Mao, Yuchen and Zhang, Guochuan},
|
||||
title = {A Nearly Quadratic-Time FPTAS for Knapsack},
|
||||
year = {2024},
|
||||
isbn = {9798400703836},
|
||||
publisher = {Association for Computing Machinery},
|
||||
address = {New York, NY, USA},
|
||||
url = {https://doi.org/10.1145/3618260.3649730},
|
||||
doi = {10.1145/3618260.3649730},
|
||||
abstract = {We investigate the classic Knapsack problem and propose a fully polynomial-time approximation scheme (FPTAS) that runs in O(n + (1/)2) time. Prior to our work, the best running time is O(n + (1/)11/5) [Deng, Jin, and Mao’23]. Our algorithm is the best possible (up to a polylogarithmic factor), as Knapsack has no O((n + 1/)2−δ)-time FPTAS for any constant δ > 0, conditioned on the conjecture that (min, +)-convolution has no truly subquadratic-time algorithm.},
|
||||
booktitle = {Proceedings of the 56th Annual ACM Symposium on Theory of Computing},
|
||||
pages = {283–294},
|
||||
numpages = {12},
|
||||
keywords = {Approximation scheme, Knapsack},
|
||||
location = {Vancouver, BC, Canada},
|
||||
series = {STOC 2024}
|
||||
author = {Chen, Lin and Lian, Jiayi and Mao, Yuchen and Zhang, Guochuan},
|
||||
title = {A Nearly Quadratic-Time FPTAS for Knapsack},
|
||||
year = {2024},
|
||||
isbn = {9798400703836},
|
||||
publisher = {Association for Computing Machinery},
|
||||
address = {New York, NY, USA},
|
||||
url = {https://doi.org/10.1145/3618260.3649730},
|
||||
doi = {10.1145/3618260.3649730},
|
||||
abstract = {We investigate the classic Knapsack problem and propose a fully polynomial-time approximation scheme (FPTAS) that runs in O(n + (1/)2) time. Prior to our work, the best running time is O(n + (1/)11/5) [Deng, Jin, and Mao'23]. Our algorithm is the best possible (up to a polylogarithmic factor), as Knapsack has no O((n + 1/)2-\ensuremath{\delta})-time FPTAS for any constant \ensuremath{\delta} > 0, conditioned on the conjecture that (min, +)-convolution has no truly subquadratic-time algorithm.},
|
||||
booktitle = {Proceedings of the 56th Annual ACM Symposium on Theory of Computing},
|
||||
pages = {283–294},
|
||||
numpages = {12},
|
||||
keywords = {Approximation scheme, Knapsack},
|
||||
location = {Vancouver, BC, Canada},
|
||||
series = {STOC 2024}
|
||||
}
|
||||
|
||||
|
||||
@incollection{salowe_parametric,
|
||||
author = {Salowe, Jeffrey S.},
|
||||
title = {Parametric search},
|
||||
year = {1997},
|
||||
isbn = {0849385245},
|
||||
publisher = {CRC Press, Inc.},
|
||||
address = {USA},
|
||||
booktitle = {Handbook of Discrete and Computational Geometry},
|
||||
pages = {683–695},
|
||||
numpages = {13}
|
||||
}
|
||||
author = {Salowe, Jeffrey S.},
|
||||
title = {Parametric search},
|
||||
year = {1997},
|
||||
isbn = {0849385245},
|
||||
publisher = {CRC Press, Inc.},
|
||||
address = {USA},
|
||||
booktitle = {Handbook of Discrete and Computational Geometry},
|
||||
pages = {683–695},
|
||||
numpages = {13}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user