Abstract
The sub-optimality approximation problem considers an optimization problem \(\mathcal{O}\), its optimal solution σ *, and a variable x with domain {d 1,...,d m } and returns approximations to \(\mathcal{O}\)[\(x \longleftarrow d_1\)],...,\(\mathcal{O}\)[\(x \longleftarrow d_m\)], where \(\mathcal{O}\)[\(x \longleftarrow d_1\)] denotes the problem \(\mathcal{O}\) with x assigned to d i . The sub-optimality approximation problem is at the core of online stochastic optimization algorithms and it can also be used for solution repair and approximate filtering of optimization constraints. This paper formalizes the problem and presents sub-optimality approximation algorithms for metric TSPs, packet scheduling, and metric k-medians that run faster than the optimal or approximation algorithms. It also presents results on the hardness/easiness of sub-optimality approximations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arya, V., Garg, N., Khandekar, R., Pandit, V.: Local search heuristics for k-median and facility location problems. In: Proceedings of the 33rd ACM Symposium on the Theory of Computing (STOC 2001) (2001)
Bent, R., Van Hentenryck, P.: Online Stochastic and Robust Optimization. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 286–300. Springer, Heidelberg (2004)
Bent, R., Van Hentenryck, P.: Regrets Only. Online Stochastic Optimization under Time Constraints. In: AAAI 2004, San Jose, CA (July 2004)
Bent, R., Van Hentenryck, P.: Scenario Based Planning for Partially Dynamic Vehicle Routing Problems with Stochastic Customers. O.R. 52(6) (2004)
Bent, R., Van Hentenryck, P.: The Value of Consensus in Online Stochastic Scheduling. In: ICAPS 2004, Whistler, British Columbia, Canada (2004)
Bent, R., Van Hentenryck, P.: Online Stochastic Optimization without Distributions. In: ICAPS 2005, Monterey, CA (2005)
Bent, R., Van Hentenryck, P., Ufval, E.: Online Stochastic Optimization Under Time Constraints. Working Paper (2005)
Chang, H., Givan, R., Chong, E.: On-line Scheduling Via Sampling. Artificial Intelligence Planning and Scheduling (AIPS 2000), pp. 62–71 (2000)
Chrobak, M., Kenyon, C., Young, N.: The reverse greedy algorithm for the metric k-median problem. In: The Eleventh International Computing and Combinatorics Conference (Cocoon 2005), Kunming, Yunnan (2005)
Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A Decentralized Network Coordinate System. In: SIGCOMM 2004(August 2004)
Fiat, A., Woeginger, G.: Online Algorithms: The State of the Art (1998)
Focacci, F., Lodi, A., Milano, M.: Optimization-Oriented Global Constraints. Constraints 7(3-4), 351–365 (2002)
Lund, C., Yannakakis, M.: On the Hardness of Approximating Minimization Problems. In: STOC 1993, New York, NY (1993)
Michel, L., Van Hentenryck, P.: A Simple Tabu Search for Warehouse Location. European Journal of Operational Research 157(3), 576–591 (2004)
Van Hentenryck, P., Flener, P., Pearson, J., Ågren, M.: Tractable symmetry breaking for csps with interchangeable values. In: IJCAI 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bent, R., Katriel, I., Van Hentenryck, P. (2005). Sub-optimality Approximations. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_12
Download citation
DOI: https://doi.org/10.1007/11564751_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)