Sciweavers

Share
19 search results - page 1 / 4
» A Partition-Based Relaxation For Steiner Trees
Sort
View
CORR
2007
Springer
134views Education» more  CORR 2007»
8 years 10 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan
IPCO
2010
152views Optimization» more  IPCO 2010»
8 years 11 months ago
Hypergraphic LP Relaxations for Steiner Trees
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
Deeparnab Chakrabarty, Jochen Könemann, David...
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
8 years 11 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
IPCO
2008
91views Optimization» more  IPCO 2008»
8 years 11 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
IPCO
2001
166views Optimization» more  IPCO 2001»
8 years 11 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
books