Approximate Max \(k\)-Cut with subgraph guarantee

DOI10.1016/S0020-0190(98)00005-2zbMath1338.68221MaRDI QIDQ293220

Viggo Kann, Alessandro Panconesi, Jens Lagergren

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000052?np=y

zbMATH Keywords

approximationspanning subgraphsinduced subgraphsMax \(k\)-Cut

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Optimization, approximation, and complexity classes
• A Short Proof of the Factor Theorem for Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate Max \(k\)-Cut with subgraph guarantee