Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.
Dimitris BertsimasChung-Piaw TeoRakesh VohraPublished in: IPCO (1995)
Keyphrases
- approximation algorithms
- randomized algorithms
- vertex cover
- special case
- approximation schemes
- np hard
- np hardness
- worst case
- minimum cost
- exact algorithms
- set cover
- network design problem
- quadratic program
- np complete
- greedy algorithm
- polynomial time approximation
- constraint satisfaction problems
- combinatorial auctions
- scheduling problem
- genetic algorithm