Refuting a conjecture of Goemans on bounded degree spanning trees
Year of publication: |
November 2016
|
---|---|
Authors: | Chestnut, Stephen ; Nägele, Martin ; Zenklusen, Rico |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 6, p. 766-771
|
Subject: | Bounded degree spanning tree | Approximation algorithm | Matroid | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
Static and dynamic source locations in undirected networks
Turner, Lara Ruth, (2015)
-
Comparing apples and oranges : query trade-off in submodular maximization
Buchbinder, Niv, (2017)
- More ...
-
A 2-approximation for the maximum satisfying bisection problem
Ries, Bernard, (2011)
-
Stochastic convergence of random search methods to fixed size Pareto front approximations
Laumanns, Marco, (2011)
-
Congestion games viewed from M-convexity
Fujishige, Satoru, (2015)
- More ...