MétaCan
Menu
Back to cohort
Record W2415039998 · doi:10.4230/lipics.swat.2016.3

A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs

2016· preprint· en· W2415039998 on OpenAlexfundno aff
Zachary Friggstad, Jochen Koenemann, Mohammad Shadravan

Bibliographic record

VenueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
Typepreprint
Languageen
FieldComputer Science
TopicComplexity and Algorithms in Graphs
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaHausdorff Center for MathematicsUniversity of Waterloo
KeywordsSteiner tree problemBipartite graphCombinatoricsLogarithmMathematicsTree (set theory)Constant (computer programming)Discrete mathematicsLinear programming relaxationCover (algebra)Set (abstract data type)Upper and lower boundsComputer scienceAlgorithmGraphLinear programming

Abstract

fetched live from OpenAlex

We demonstrate that the integrality gap of the natural cut-based LP relaxation for the directed Steiner tree problem is $O(\log k)$ in quasi-bipartite graphs with $k$ terminals. Such instances can be seen to generalize set cover, so the integrality gap analysis is tight up to a constant factor. A novel aspect of our approach is that we use the primal-dual method; a technique that is rarely used in designing approximation algorithms for network design problems in directed graphs.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.017
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.017
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.003
Scholarly communication0.0050.010
Open science0.0030.004
Research integrity0.0020.009
Insufficient payload (model declined to judge)0.0100.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.042
GPT teacher head0.294
Teacher spread0.252 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics)Same topicComplexity and Algorithms in GraphsFrench-language works237,207