Search Sciweavers | Sciweavers

632 search results - page 24 / 127

» On the Approximability of the Steiner Tree Problem

click to vote

IPCO
2008

91views Optimization» more IPCO 2008»

New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem

13 years 10 months ago

Download www.cc.gatech.edu

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....

claim paper

Read More »

click to vote

ESA
2008
Springer

134views Algorithms» more ESA 2008»

A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry

13 years 10 months ago

Download www.mpi-inf.mpg.de

The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...

Spyros Angelopoulos

claim paper

Read More »

click to vote

FOCS
2005
IEEE

140views Theoretical Computer Science» more FOCS 2005»

How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems

14 years 2 months ago

Download www.mit.edu

Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...

Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...

claim paper

Read More »

click to vote

FOCS
1998
IEEE

81views Theoretical Computer Science» more FOCS 1998»

Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

14 years 1 months ago

Download www.ccs.neu.edu

Kamal Jain

claim paper

Read More »