Coloring down : 3/2-approximation for special cases of the weighted tree augmentation problem
Year of publication: |
2022
|
---|---|
Authors: | Iglesias, Jennifer ; Ravi, R. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 6, p. 693-698
|
Subject: | Approximation algorithm | Network design | Integrality gap | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
On small-depth tree augmentations
Parekh, Ojas, (2022)
-
Snoeck, André, (2022)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2021)
- More ...
-
Approximating k-cuts using network strength as a Lagrangean relaxation
Ravi, R., (2008)
-
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Nagarajan, Viswanath, (2010)
-
A PTAS for the chance-constrained knapsack problem with random item sizes
Goyal, Vineet, (2010)
- More ...