Approximation Algorithms for Degree-Constrained Bipartite Network Flow.
Elif AkçaliAlper ÜngörPublished in: ISCIS (2003)
Keyphrases
- approximation algorithms
- network flow
- minimum cost
- set cover
- np hard
- undirected graph
- bipartite graph
- special case
- min cost
- worst case
- integer programming
- vertex cover
- network design problem
- spanning tree
- primal dual
- linear programming
- approximation ratio
- integer program
- graph model
- randomized algorithms
- disjoint paths
- optimization model
- constant factor
- combinatorial auctions
- open shop
- optimal solution
- objective function