Sciweavers

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

7

CORR
2010
Springer

favoriteEmaildiscussreport

57views Education» more CORR 2010»

k-Edge-Connectivity: Approximation and LP Relaxation

13 years 4 months ago

k-Edge-Connectivity: Approximation and LP Relaxation

Download infoscience.epfl.ch

In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost F E such that (V, F) is k-edge-connected. If P = NP, for unit costs, the best possible approximation ratio is known to be 1 + (1/k) for

David Pritchard

Real-time Traffic

CORR 2010 | Education | Possible Approximation Ratio | Spanning Subgraph Problem | Unit Costs |

claim paper

Related Content

» An improved approximation algorithm for the partial latin square extension problem

» Polyhedral outer approximations with application to natural language parsing

» LPbased solution methods for the asymmetric TSP

» On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

» Linear Programming Relaxations and Belief Propagation An Empirical Study

» Improved approximation algorithms for multidimensional bin packing problems

» On linear and semidefinite programming relaxations for hypergraph matching

» On the knapsack closure of 01 Integer Linear Programs

Post Info
More Details (n/a)

Added	25 Dec 2010
Updated	25 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	David Pritchard

Comments (0)