Suchergebnisse - "LP-rounding algorithms"

On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms

Autoren: Yang, Yongge Chen, Po-An Lee, Yu-Ching et al.

Quelle: Optim Lett

Schlagwörter: 0301 basic medicine, Original Paper, 03 medical and health sciences, 0211 other engineering and technologies, 02 engineering and technology, 3. Good health

Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/36597504

LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem: (Extended Abstract)

Autoren: Marek Chrobak Li Yan

Quelle: Lecture Notes in Computer Science ISBN: 9783642382321

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Zugangs-URL: http://arxiv.org/pdf/1205.1281
http://arxiv.org/abs/1205.1281
https://link.springer.com/chapter/10.1007/978-3-642-38233-8_31
https://core.ac.uk/display/5247232
https://link.springer.com/content/pdf/10.1007%2F978-3-642-38233-8_31.pdf
https://dblp.uni-trier.de/db/conf/ciac/ciac2013.html#YanC13
https://www.sciencedirect.com/science/article/abs/pii/S1570866715000477
http://ui.adsabs.harvard.edu/abs/2012arXiv1205.1281Y/abstract
https://rd.springer.com/chapter/10.1007/978-3-642-38233-8_31
https://www.sciencedirect.com/science/article/pii/S1570866715000477
http://dblp.uni-trier.de/db/journals/corr/corr1205.html#abs-1205-1281
https://dblp.uni-trier.de/db/journals/corr/corr1205.html#abs-1205-1281

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

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

Weitere Verfasser: Kumar, Nikhil Nan, J. J. Swamy, Chaitanya et al.

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

LP-rounding algorithms for facility-location problems

Autoren: Byrka, Jaroslaw Ghodsi, MohammadReza Srinivasan, Aravind

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/1007.3611

LP-rounding Algorithms for the Fault-Tolerant Facility Placement Problem

Autoren: Yan, Li Chrobak, Marek

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1205.1281

Approximation Algorithms for Correlated Knapsack Orienteering

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

Weitere Verfasser: Alemán Espinosa, David Swamy, Chaitanya David Alemán Espinosa and Chaitanya Swamy

Schlagwörter: Vehicle routing problems, Adaptivity gap, Stochastic orienteering, ddc:004, LP rounding algorithms, Approximation algorithms

Dateibeschreibung: application/pdf

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

On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms.

Autoren: Yang, Yongge Chen, Po-An Lee, Yu-Ching et al.

Quelle: Optimization Letters; Nov2023, Vol. 17 Issue 8, p1853-1872, 20p

LP-rounding algorithms for the fault-tolerant facility placement problem

Autoren: Yan, Li Chrobak, Marek NSF

Weitere Verfasser: Yan, Li Chrobak, Marek NSF

Quelle: Journal of Discrete Algorithms ; volume 33, page 93-114 ; ISSN 1570-8667

Verfügbarkeit: http://dx.doi.org/10.1016/j.jda.2015.03.004
https://api.elsevier.com/content/article/PII:S1570866715000477?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S1570866715000477?httpAccept=text/plain

Improved Algorithms for MST and Metric-TSP Interdiction

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

Weitere Verfasser: Linhares, André Swamy, Chaitanya André Linhares and Chaitanya Swamy

Schlagwörter: Approximation algorithms, interdiction problems, LP-rounding algorithms, iterative rounding, tree-knapsack problem, supermodular functions

Dateibeschreibung: 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

Verfügbarkeit: 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

Findings from National Tsing-Hua University Update Knowledge of Vaccination (On the Firefighter Problem With Spreading Vaccination for Maximizing the Number of Saved Nodes: the Ip Model and Lp Rounding Algorithms).

Quelle: Health & Medicine Week. 11/29/2024, p2005-2005. 1p.

LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem.

Autoren: Yan, Li Chrobak, Marek

Quelle: Algorithms & Complexity (9783642382321); 2013, p370-381, 12p

Reports Outline Vaccination Study Findings from National Tsing-Hua University (On the Firefighter Problem With Spreading Vaccination for Maximizing the Number of Saved Nodes: the Ip Model and Lp Rounding Algorithms).

Quelle: Health & Medicine Week. 2/10/2023, p4310-4310. 1p.

Centrality of trees for capacitated -center

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

Schlagwörter: 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

Verfügbarkeit: 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

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

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

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

Schlagwörter: approximation algorithms, capacitated network location problems, capacitated k-center problem, LP-rounding algorithms

Dateibeschreibung: application/pdf

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

Verfügbarkeit: 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 Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach

Autoren: Lee, Changyeol Shin, Yongho An, Hyung-Chan

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Databases, Computer Science - Data Structures and Algorithms, Databases (cs.DB), Data Structures and Algorithms (cs.DS), Machine Learning (cs.LG)

Zugangs-URL: http://arxiv.org/abs/2505.18043

A performance study of some approximation algorithms for minimum dominating set in a graph

Autoren: Li, Jonathan S. Potru, Rohan Shahrokhi, Farhad

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2009.04636

A polynomial-time approximation scheme for the airplane refueling problem.

Autoren: Gamzu, Iftah Segev, Danny

Quelle: Journal of Scheduling; Feb2019, Vol. 22 Issue 1, p119-135, 17p

Schlagwörter: POLYNOMIAL time algorithms, AIRPLANES, FUELING, ENERGY consumption, BACKPACKS

Approximating soft-capacitated facility location problem with uncertainty.

Autoren: Cai, Shuxin Yang, Wenguo Tang, Yaohua

Quelle: Journal of Combinatorial Optimization; Aug2014, Vol. 28 Issue 2, p496-504, 9p

Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems

Autoren: Dezfuli, Sina Friggstad, Zachary Post, Ian et al.

Index Begriffe: Computer Science - Data Structures and Algorithms, F.2.2, G.1.6, G.2, text

URL: http://arxiv.org/abs/2111.07414

On the Computational Complexity of Linear Discrepancy

Autoren: Li, Lily Nikolov, Aleksandar

Index Begriffe: discrepancy theory, linear discrepancy, rounding, NP-hardness, Data processing Computer science, InProceedings, publishedVersion