Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
SIAM Journal on Computing , Year =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A (3 + 2√2 + ε)-approximation for metric k-means obtained by adapting the greedy LMP 2-approximation for facility location to squared distances and combining it with a recent framework.
citing papers explorer
-
Directed Low Diameter Decomposition for Structured Digraphs
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
-
An Improved Greedy Approximation for (Metric) $k$-Means
A (3 + 2√2 + ε)-approximation for metric k-means obtained by adapting the greedy LMP 2-approximation for facility location to squared distances and combining it with a recent framework.