Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite Graphs.
Kook Jin AhnSudipto GuhaPublished in: SODA (2014)
Keyphrases
- approximation schemes
- approximation algorithms
- network design problem
- lot sizing
- facility location problem
- examination timetabling
- np hard
- network flow problem
- location problems
- np complete
- dynamic programming
- transportation problem
- facility location
- fixed charge
- worst case
- linear programming
- image enhancement
- graph matching
- special case
- evolutionary algorithm
- image analysis
- object recognition