NDLI: How to pay, come what may: approximation algorithms for demand-robust covering problems

Content Provider	IEEE Xplore Digital Library
Author	Dhamdhere, K. Goyal, V. Ravi, R. Singh, M.
Copyright Year	2005
Description	Author affiliation: Google Inc., Mountain View, CA, USA (Dhamdhere, K.)
Abstract	Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worst-case among the various uncertain scenarios in the model. While these approaches may be thought of defining data- or cost-robust problems, we formulate a new "demand-robust" model motivated by recent work on two-stage stochastic optimization problems. We propose this in the framework of general covering problems and prove a general structural lemma about special types of first-stage solutions for such problems: there exists a first-stage solution that is a minimal feasible solution for the union of the demands for some subset of the scenarios and its objective function value is no more than twice the optimal. We then provide approximation algorithms for a variety of standard discrete covering problems in this setting, including minimum cut, minimum multi-cut, shortest paths, Steiner trees, vertex cover and un-capacitated facility location. While many of our results draw from rounding approaches recently developed for stochastic programming problems, we also show new applications of old metric rounding techniques for cut problems in this demand-robust setting.
Sponsorship	IEEE Comput. Soc. Tech. Comm. on Math. Found. of Comput
Starting Page	367
Ending Page	376
File Size	312692
Page Count	10
File Format	PDF
ISBN	0769524680
DOI	10.1109/SFCS.2005.42
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-10-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Approximation algorithms Robustness Uncertainty Stochastic processes Mathematical programming Computer science Cost function Application software Decision theory Minimax techniques
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

How to pay, come what may: Approximation algorithms for demand-robust covering problems (2005)

How to pay, come what may: Approximation algorithms for demand-robust covering problems (2005)

How to pay, come what may: Approximation algorithms for demand-robust covering problems (2005)

Optimality of affine policies in multi-stage robust optimization

A genetic algorithm for minimax optimization problems

Stochastic manufacturing systems under unknown demand and robust control criteria

Approximate stochastic realization and robust prediction: algorithms for iterative solution

Minimax-based reinforcement learning with state aggregation

Stochastic and Robust Approaches to Optimization Problems under Uncertainty

How to pay, come what may: approximation algorithms for demand-robust covering problems

Similar Documents

How to pay, come what may: Approximation algorithms for demand-robust covering problems (2005)

How to pay, come what may: Approximation algorithms for demand-robust covering problems (2005)

How to pay, come what may: Approximation algorithms for demand-robust covering problems (2005)

Optimality of affine policies in multi-stage robust optimization

A genetic algorithm for minimax optimization problems

Stochastic manufacturing systems under unknown demand and robust control criteria

Approximate stochastic realization and robust prediction: algorithms for iterative solution

Minimax-based reinforcement learning with state aggregation

Stochastic and Robust Approaches to Optimization Problems under Uncertainty

How to pay, come what may: approximation algorithms for demand-robust covering problems