An improved approximation lower bound for finding almost stable maximum matchings.
Koki HamadaKazuo IwamaShuichi MiyazakiPublished in: Inf. Process. Lett. (2009)
Keyphrases
- lower bound
- upper bound
- integrality gap
- polynomial approximation
- branch and bound algorithm
- linear programming relaxation
- np hard
- branch and bound
- worst case
- constant factor
- objective function
- optimal solution
- approximation algorithms
- error bounds
- randomized algorithm
- upper and lower bounds
- queueing networks
- relative error
- model selection
- approximation guarantees
- special case
- sufficiently accurate
- probabilistic model