Pith. sign in

REVIEW

On the Integrality Gap of the Directed-Component Relaxation for Steiner Tree

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1111.6698 v2 pith:G2K46XR5 submitted 2011-11-29 cs.DS

On the Integrality Gap of the Directed-Component Relaxation for Steiner Tree

classification cs.DS
keywords steinertreecostintegralityrelaxationbyrkaconstructivedirected-component
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this note, we show that the integrality gap of the $k$-Directed-Component- Relaxation($k$-DCR) LP for the Steiner tree problem, introduced by Byrka, Grandoni, Rothvob and Sanita (STOC 2010), is at most $\ln(4)<1.39$. The proof is constructive: we can efficiently find a Steiner tree whose cost is at most $\ln(4)$ times the cost of the optimal fractional $k$-restricted Steiner tree given by the $k$-DCR LP.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.