the Omega(log n) lb
This commit is contained in:
26
ref.bib
26
ref.bib
@@ -185,8 +185,8 @@
|
||||
@article{Cohen-Addad_Mömke_Verdugo_2024, title={A 2-approximation for the bounded treewidth sparsest cut problem in $\textsf{FPT}$Time}, volume={206}, ISSN={1436-4646}, url={https://doi.org/10.1007/s10107-023-02044-1}, DOI={10.1007/s10107-023-02044-1}, number={1}, journal={Mathematical Programming}, author={Cohen-Addad, Vincent and Mömke, Tobias and Verdugo, Victor}, year={2024}, month=jul, pages={479–495}, language={en} }
|
||||
@INPROCEEDINGS{uniformhardnessFocs07,
|
||||
author={Ambuhl, Christoph and Mastrolilli, Monaldo and Svensson, Ola},
|
||||
booktitle={48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)},
|
||||
title={Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling},
|
||||
booktitle={48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)},
|
||||
title={Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling},
|
||||
year={2007},
|
||||
volume={},
|
||||
number={},
|
||||
@@ -229,3 +229,25 @@
|
||||
@article{Ford_Fulkerson_1956, title={Maximal Flow Through a Network}, volume={8}, rights={https://www.cambridge.org/core/terms}, ISSN={0008-414X, 1496-4279}, url={https://www.cambridge.org/core/product/identifier/S0008414X00036890/type/journal_article}, DOI={10.4153/CJM-1956-045-5}, journal={Canadian Journal of Mathematics}, author={Ford, L. R. and Fulkerson, D. R.}, year={1956}, pages={399–404}, language={en} }
|
||||
|
||||
@article{Hu_1963, title={Multi-Commodity Network Flows}, volume={11}, ISSN={0030-364X, 1526-5463}, url={https://pubsonline.informs.org/doi/10.1287/opre.11.3.344}, DOI={10.1287/opre.11.3.344}, number={3}, journal={Operations Research}, author={Hu, T. C.}, year={1963}, month=jun, pages={344–360}, language={en} }
|
||||
|
||||
@article{schrijver_homotopic_1990,
|
||||
title = {Homotopic {Routing} {Methods}},
|
||||
language = {en},
|
||||
journal = {Paths, Flows, and VLSI-Layout},
|
||||
author = {Schrijver, Alexander},
|
||||
year = {1990},
|
||||
pages = {329 --371},
|
||||
}
|
||||
@inproceedings{aumann_rabani_1995,
|
||||
author = {Aumann, Yonatan and Rabani, Yuval},
|
||||
title = {Improved bounds for all optical routing},
|
||||
year = {1995},
|
||||
isbn = {0898713498},
|
||||
publisher = {Society for Industrial and Applied Mathematics},
|
||||
address = {USA},
|
||||
booktitle = {Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms},
|
||||
pages = {567–576},
|
||||
numpages = {10},
|
||||
location = {San Francisco, California, USA},
|
||||
series = {SODA '95}
|
||||
}
|
||||
|
Reference in New Issue
Block a user