New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
- 15 August 2009
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 130 (1) , 1-32
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On a bidirected relaxation for the MULTIWAY CUT problemDiscrete Applied Mathematics, 2005
- On the advantage of network coding for improving network throughput2005
- Approximation Hardness of the Steiner Tree Problem on GraphsLecture Notes in Computer Science, 2002
- Equitable cost allocations via primal-dual-type algorithms2002
- An improved approximation algorithm for multiway cut1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- The Steiner tree problem II: Properties and classes of facetsMathematical Programming, 1994
- The Steiner tree problem I: Formulations, compositions and extension of facetsMathematical Programming, 1994
- A catalog of steiner tree formulationsNetworks, 1993
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967