|edoc-Server der Humboldt-Universität zu Berlin|
Nan Kong, University of Pittsburgh|
Andrew J. Schaefer, University of Pittsburgh
|Title:||A factor 1/2 approximation algorithm for a class of two-stage stochastic mixed-integer programs|
|Date of Acceptance:||19.02.2004|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-10059449)|
|Keywords (eng):||Stochastic Programming, Combinatorial Optimization, Approximation Algorithms, Matching|
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|print on demand: If you click on this icon you can order a print copy of this publication.|
|Diese Seite taggen: These icons lead to social bookmarking systems where you can create and manage personal bookmarks and discover bookmakrs of other users.|
|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.|
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Gesamtzahl der Zugriffe seit Jul 2011: