G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing, 10 (1998), pp. I-I 1.

Digital Library

Google Scholar

[8]

A. Frank, Augmenting graphs to meet edge connectivity requirements, SIAM J. Discr. Math., 5 (1992), pp. 25-53.

Digital Library

Google Scholar

[9]

M. Franklin, Complexity and Security of Distributed Protocols, PhD thesis, Dept. of Computer Science, Columbia University, 1994.

Digital Library

Google Scholar

[10]

N. Garg and J. KOnemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in IEEE {20}, pp. 300-309.

Digital Library

Google Scholar

[11]

F. Glover, D. Klingman, and N. Phillips, Network Models in Optimization and Their Applications in Practice, John Wiley & Sons, Inc., New York, 1992.

Digital Library

Google Scholar

[12]

M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D. Williamson, Improved approximation algorithms for network design problems, in Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 223-232.

Digital Library

Google Scholar

[13]

M. Goemans and D. Williamson, The primal-dual method for approximation algorithms and its application to network design problems, in Hochbaum { 18}, pp. 144-191.

Digital Library

Google Scholar

[14]

R. Gomory and T. Hu, Multi-terminal network flows, J. Soc. Indust. Appl. Math, 9 (1991), pp. 551-570.

Google Scholar

[15]

M. Gr0tschel, L. Lov~isz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988.

Google Scholar

[16]

N. Hall and D. Hochbaum, A fast approximation algorithm for the multicovering problem, Discrete Applied Mathematics, 15 (1986), pp. 35-40.

Digital Library

Google Scholar

[17]

P. Hammer, E. Johnson, and U. Peled, Facets of regular 0-1 polytopes, MP, 8 (1975), pp. 179-206.

Google Scholar

[18]

D. Hochbaum, editor, Approximation Algorithms for NP- Hard Problems, PWS Publishing Company, Boston, 1997.

Digital Library

Google Scholar

[19]

O. Ibarra and C. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, JACM, 22 (1975), pp. 463-468.

Digital Library

Google Scholar

[20]

39th Annual Symposium on Foundations of Computer Science, 1998.

Google Scholar

[21]

K. Jain, A factor 2 approximation algorithm for the generalized steiner network problem, in IEEE {20}.

Digital Library

Google Scholar

[22]

R. Karp, Reducibility among combinatorial problems, in R. Miller and J. Thatcher, editors, Complexity of Computer Computations, Plenum Press, 1972, pp. 85-103.

Google Scholar

[23]

S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Hochbaum { 18}, pp. 236-265.

Digital Library

Google Scholar

[24]

E. Lawler, Fast approximation algorithms for knapsack problems, Mathematics of Operations Research, 4 (1979), pp. 339- 356.

Google Scholar

[25]

T. Magnanti, P. Mirchandani, and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Operations Research, 43 (1995), pp. 142-157.

Google Scholar

[26]

Y. Mansour and D. Peleg, An approximation algorithm for minimum-cost network design, Technical Report CS94-22, The Weizman Institute of Science, Rehovot, Isreal, 1994.

Digital Library

Google Scholar

[27]

S. Martello and P. Toth, Knapsack Problems: Algorithms and computer implementations, Series in Discrete Mathematics and Optimization, Wiley-Interscience, 1990.

Digital Library

Google Scholar

[28]

D. Naor, D. Gusfield, and C. Martel, A fast algorithm for optimally increasing the edge connectivity, in 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 698- 707.

Google Scholar

[29]

M. Padberg, T. Van Roy, and L. Wolsey, Valid linear inequalities for fixed charge problems, Operations Research, 33 (1985), pp. 842-861.

Google Scholar

[30]

S. Plotkin, D. Shmoys, and I~. Tardos, Fast approximation algorithms for fractional packing and covering problem~, Mathematics of Operations Research, 20 (1995), pp. 257-301.

Digital Library

Google Scholar

[31]

E Salman, J. Cheriyan, R. Ravi, and S. Subramanian, Buyat-bulk network design: approximating the single-sink edge installation problem, in Proc. 8th Annual ACM-SIAM Symp. on Discrete Algorithms, 1997.

Digital Library

Google Scholar

[32]

S. Schwarz and S. Krumke, On budget constrained flow improvement, IPL, 66 (1998), pp. 291-297.

Digital Library

Google Scholar

[33]

L. Wolsey, Facets for a linear inequality in 0-1 variables, MP, 8 (1975), pp. 168-175.

Google Scholar

Cited By

View all

Bansal NBatra JMarx D(2021)Non-uniform geometric set cover and scheduling on multiple machinesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458243(3011-3021)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458243
Chekuri CQuanrud KChan T(2019)On approximating (sparse) covering integer programsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310532(1596-1615)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310532
Gupta AKrishnaswamy RKumar APanigrahi DChan T(2019)Elastic cachingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310445(143-156)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310445
Show More Cited By

Index Terms

Strengthening integrality gaps for capacitated network design and covering problems
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Mathematical optimization
      1. Mixed discrete-continuous optimization
        Integer programming
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization
      1. Mixed discrete-continuous optimization
        Integer programming
  2. Randomness, geometry and discrete structures

Recommendations

Integrality gaps for strengthened linear relaxations of capacitated facility location

Metric uncapacitated facility location is a well-studied problem for which linear programming methods have been used with great success in deriving approximation algorithms. Capacitated facility location (Cfl) is a generalization for which there are ...
Primal-dual schema for capacitated covering problems

Primal-dual algorithms have played an integral role in recent developments in approximation algorithms, and yet there has been little work on these algorithms in the context of LP relaxations that have been strengthened by the addition of more ...
Integrality gaps for strong linear programming and semidefinite programming relaxations

Comments

Information & Contributors

Information

Published In

SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

February 2000

965 pages

ISBN:0898714532

Chairman:
David Shmoys

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 2000

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

71
Total Citations
View Citations
1,947
Total Downloads

Downloads (Last 12 months)181
Downloads (Last 6 weeks)33

Reflects downloads up to 04 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bansal NBatra JMarx D(2021)Non-uniform geometric set cover and scheduling on multiple machinesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458243(3011-3021)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458243
Chekuri CQuanrud KChan T(2019)On approximating (sparse) covering integer programsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310532(1596-1615)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310532
Gupta AKrishnaswamy RKumar APanigrahi DChan T(2019)Elastic cachingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310445(143-156)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310445
Chakrabarty DNegahbani M(2019)Generalized Center Problems with OutliersACM Transactions on Algorithms10.1145/333851315:3(1-14)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1145/3338513
Jiao LZhou RLin XChen X(2019)Online Scheduling of Traffic Diversion and Cloud Scrubbing with Uncertainty in Current InputsProceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing10.1145/3323679.3326525(271-280)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3323679.3326525
Chen SZhou ZLiu FLi ZRen S(2018)CloudHeatACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/31996753:3(1-31)Online publication date: 13-Jun-2018
https://dl.acm.org/doi/10.1145/3199675
Grandoni FKalaitzis CZenklusen RDiakonikolas IKempe DHenzinger M(2018)Improved approximation for tree augmentation: saving by rewiringProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188898(632-645)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188898
Dey SMolinaro M(2018)Theoretical challenges towards cutting-plane selectionMathematical Programming: Series A and B10.1007/s10107-018-1302-4170:1(237-266)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s10107-018-1302-4
Bodur MDel Pia ADey SMolinaro MPokutta S(2018)Aggregation-based cutting-planes for packing and covering integer programsMathematical Programming: Series A and B10.1007/s10107-017-1192-x171:1-2(331-359)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1007/s10107-017-1192-x
Kamiyama N(2018)A Note on Submodular Function Minimization with Covering Type Linear ConstraintsAlgorithmica10.1007/s00453-017-0363-880:10(2957-2971)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s00453-017-0363-8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Integrality gaps for strengthened linear relaxations of capacitated facility location

Primal-dual schema for capacitated covering problems

Integrality gaps for strong linear programming and semidefinite programming relaxations

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Integrality gaps for strengthened linear relaxations of capacitated facility location

Primal-dual schema for capacitated covering problems

Integrality gaps for strong linear programming and semidefinite programming relaxations

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations