First EPTAS for ConstrainedMinCut, MinQuotientCut and ProductSparsestCut on everywhere-δ-dense graphs via weak regularity lemma and sampling.
Polynomial time approxi- mation schemes for dense instances of minimum constraint satisfaction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
EPTAS for Hard Graph Cut Problems for Dense Graphs
First EPTAS for ConstrainedMinCut, MinQuotientCut and ProductSparsestCut on everywhere-δ-dense graphs via weak regularity lemma and sampling.