Citation Details
Chapter
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity
Automata, Languages and Programming, 2011, Volume 6755
ISBN : 978-3-642-22005-0
4 Items cite this Chapter
Page: 1
Conference Paper
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
Conference: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, Year: 2012, Page 263
DOI: 10.1109/FOCS.2012.30
Read OnlineChapter
Combinatorial Algorithms
Series: Lecture Notes in Computer Science, Year: 2023, Volume 13889, Page 1
DOI: 10.1007/978-3-031-34347-6_1
Read OnlineArticle
Approximating subset k-connectivity problems
Journal: Journal of Discrete Algorithms, 2012, Volume 17, Page 51
DOI: 10.1016/j.jda.2012.08.001
Read OnlineChapter
Approximation and Online Algorithms
Series: Lecture Notes in Computer Science, Year: 2012, Volume 7164, Page 9
DOI: 10.1007/978-3-642-29116-6_2
Read OnlinePage: 1
citation rank
66th
percentile
Citations per year
 | |
| 2012 | 2023 |
citing journals
citing books
© 2024 Springer. Part of Springer Nature.