Approximation algorithms for the bi-criteria weighted MAX-CUT problem.
Eric AngelEvripidis BampisLaurent GourvèsPublished in: Discret. Appl. Math. (2006)
Keyphrases
- computational complexity
- approximation algorithms
- bicriteria
- np hard
- special case
- knapsack problem
- worst case
- flowshop
- efficient solutions
- integer linear programming
- minimum cost
- vertex cover
- completion times
- scheduling problem
- primal dual
- approximation ratio
- constant factor
- shortest path problem
- constant factor approximation
- precedence constraints
- integer programming
- optimal solution
- randomized algorithms
- disjoint paths
- undirected graph
- single machine