Search Results - "LP rounding algorithms"

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique

Authors: Kumar, Nikhil Nan, J. J. Swamy, Chaitanya et al.

Contributors: Kumar, Nikhil Nan, J. J. Swamy, Chaitanya et al.

Subject Terms: FOS: Computer and information sciences, Network Design, Iterative rounding, Data Structures and Algorithms, F.2.2, G.2, Data Structures and Algorithms (cs.DS), ddc:004, LP rounding algorithms, Approximation algorithms, Cut-requirement functions, Weak Supermodularity

File Description: application/pdf

Access URL: http://arxiv.org/abs/2507.04473
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.38

Approximation Algorithms for Correlated Knapsack Orienteering

Authors: Alemán Espinosa, David Swamy, Chaitanya David Alemán Espinosa and Chaitanya Swamy

Contributors: Alemán Espinosa, David Swamy, Chaitanya David Alemán Espinosa and Chaitanya Swamy

Subject Terms: Vehicle routing problems, Adaptivity gap, Stochastic orienteering, ddc:004, LP rounding algorithms, Approximation algorithms

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.29

Improved Algorithms for MST and Metric-TSP Interdiction

Authors: Linhares, André Swamy, Chaitanya André Linhares and Chaitanya Swamy

Contributors: Linhares, André Swamy, Chaitanya André Linhares and Chaitanya Swamy

Subject Terms: Approximation algorithms, interdiction problems, LP-rounding algorithms, iterative rounding, tree-knapsack problem, supermodular functions

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.32

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2017.32
https://nbn-resolving.org/urn:nbn:de:0030-drops-74552
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.32

Centrality of trees for capacitated -center

Authors: An, Hyung-Chan Bhaskara, Aditya Chekuri, Chandra et al.

Subject Terms: Approximation algorithms, Capacitated network location problems, Capacitated k-center problem, LP-rounding algorithms

Relation: https://infoscience.epfl.ch/record/216587/files/10107_2014_Article_857.pdf; Mathematical Programming; https://infoscience.epfl.ch/handle/20.500.14299/124028; WOS:000364528000003

Availability: https://doi.org/10.1007/s10107-014-0857-y
https://infoscience.epfl.ch/handle/20.500.14299/124028
https://hdl.handle.net/20.500.14299/124028

Centrality of Trees for Capacitated k-Center

Authors: Hyung-chan An Aditya Bhaskara Ch Ra Chekuri Shalmoli Gupta et al.

Contributors: Hyung-chan An Aditya Bhaskara Ch Ra Chekuri Shalmoli Gupta et al.

Source: http://web.engr.illinois.edu/~chekuri/papers/capacitated-k-center.pdf.

Subject Terms: approximation algorithms, capacitated network location problems, capacitated k-center problem, LP-rounding algorithms

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.468.1913

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.468.1913
http://web.engr.illinois.edu/~chekuri/papers/capacitated-k-center.pdf

Improved Algorithms for MST and Metric-TSP Interdiction

Authors: Swamy, Chaitanya

Index Terms: Approximation algorithms, interdiction problems, LP-rounding algorithms, iterative rounding, tree-knapsack problem, supermodular functions, Data processing Computer science, InProceedings, publishedVersion