Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.90553MaRDI QIDQ5897567FDOQ5897567

Authors: Eric Angel, Evripidis Bampis, Laurent Gourvès 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Approximation algorithms for the bi-criteria weighted MAX-CUT problem
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
• Approximation algorithms for maximum cut with limited unbalance
• Approximating Maximum Cut with Limited Unbalance

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Randomized algorithms (68W20) Approximation algorithms (68W25)

Cited In (1)

• Approximation algorithms for the bi-criteria weighted MAX-CUT problem

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897567)