Work

A factor 1/2 approximation algorithm for a class of two-stage stochastic mixed-integer programs

Year: 2004

Type: book

Abstract: 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.

Source: edoc Publication server (Humboldt University of Berlin)

DOI: 10.18452/2944

Authors: Kong, Nan, Schaefer, Andrew J.

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W879967848

FWCI: 0.209

Cites: 7

Cited by: 2

Related to: 20