A factor approximation algorithm for two-stage stochastic matching problems

We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1/2 approximation algorithm and prove its correctness. We also provide a tight example to show the bound given by the algorithm is exactly 1/2. Computational resul...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 172; no. 3; pp. 740 - 746
Main Authors Kong, Nan, Schaefer, Andrew J.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier 01.08.2006
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Algorithms
Applied sciences
Approximation
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Stochastic models
Studies
Matching
NP complete problem
Approximation algorithms
Approximation algorithm
Combinatorial optimization
Adaptation
Stochastic programming
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/j.ejor.2004.10.011

Cover

More Information
Summary:We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1/2 approximation algorithm and prove its correctness. We also provide a tight example to show the bound given by the algorithm is exactly 1/2. Computational results on some two-stage stochastic bipartite matching instances indicate that the performance of the approximation algorithm appears to be substantially better than its worst-case performance. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2004.10.011