Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1142.90459OpenAlexW2649657569MaRDI QIDQ5479375

Martin Pál, Chandra Chekuri, Moses Charikar

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538462

Mathematics Subject Classification ID

Nonlinear programming (90C30) Stochastic programming (90C15)

Related Items (10)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ Stochastic models for budget optimization in search-based advertising ⋮ Universal Algorithms for Clustering Problems ⋮ Configuration balancing for stochastic requests ⋮ Approximation Algorithms for Stochastic and Risk-Averse Optimization ⋮ Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems ⋮ Commitment under uncertainty: Two-stage stochastic matching problems ⋮ Maximizing expected utility over a knapsack constraint ⋮ Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty ⋮ Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques