Approximation algorithms for combinatorial optimization under uncertainty
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003. === Includes bibliographical references (p. 87-90). === Combinatorial optimization problems arise in many fields of industry and technology, where they are frequently used in productio...
Main Author: | Minkoff, Maria, 1976- |
---|---|
Other Authors: | David R. Karger. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/87452 |
Similar Items
-
Analysis of approximation and uncertainty in optimization
by: Mastin, Dana Andrew
Published: (2015) -
The Prize Collecting Steiner Tree problem
by: Minkoff, Maria, 1976-
Published: (2014) -
Stochastic optimization of electricity transmission : dynamic programming algorithms under uncertainties
by: Sivakumar, Ishwar Krishnan Ashok, 1980-
Published: (2013) -
Algorithms and algorithmic obstacles for probabilistic combinatorial structures
by: Li, Quan, Ph. D. Massachusetts Institute of Technology
Published: (2018) -
Criticality and parallelism in combinatorial optimization
by: Siapas, Athanassios G
Published: (2005)