Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.
Marek KarpinskiMiroslaw KowalukAndrzej LingasPublished in: Fundam. Informaticae (2004)
Keyphrases
- approximation algorithms
- low degree
- undirected graph
- np hard
- special case
- integrality gap
- worst case
- vertex cover
- approximation guarantees
- minimum cost
- approximation ratio
- primal dual
- spanning tree
- disjoint paths
- constant factor
- agnostic learning
- search algorithm
- uniform distribution
- weighted graph
- randomized algorithms
- polynomial time approximation
- graph structure
- directed graph
- scheduling problem
- lower bound