Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

IPCO
2010

favoriteEmaildiscussreport

152views Optimization» more IPCO 2010»

Hypergraphic LP Relaxations for Steiner Trees

13 years 11 months ago

Hypergraphic LP Relaxations for Steiner Trees

Download sma.epfl.ch

We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K

Deeparnab Chakrabarty, Jochen Könemann, David

Real-time Traffic

Hypergraphic Lp Relaxations | IPCO 2010 | LP Relaxation | Optimization | Partition Lp Relaxation |

claim paper

Related Content

» New GeometryInspired Relaxations and Algorithms for the Metric Steiner Tree Problem

» An Improved LPbased Approximation for Steiner Tree

» LP Rounding Approximation Algorithms for Stochastic Network Design

» Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	IPCO
Authors	Deeparnab Chakrabarty, Jochen Könemann, David Pritchard

Comments (0)