Abstract
We identify a new genre of algorithmic problems – design problems – and study them from an algorithmic and complexity-theoretic view point. We use the learning techniques of Freund-Schapire [FS99] and its generalizations to show that for a large class of problems, the design version is as easy as the optimization version.
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
Barahona, F., Baiou, M.: A linear programming approach to increasing the weight of all minimum spanning trees. In: INFORMS (2005)
Boyd, S., Diaconis, P., Xiao, L.: The fastest mixing markov chain on a graph. In: SIAM Review (2004)
Elson, J., Karp, R., Papadimitriou, C., Shenker, S.: Global synchronization in sensornets. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, Springer, Heidelberg (2004)
Fortnow, L., Impagliazzo, R., Kabanets, V., Umans, C.: On the complexity of succinct zero-sum games. In: IEEE Conference on Computational Complexity, pp. 323–332 (2005)
Flaxman, A., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: SODA (2005)
Freund, Y., Schapire, R.: Adaptive game playing using multiplicative weights. Games and Economic Behavior 29, 79–103 (1999)
Frederickson, G., Solis-Oba, R.: Increasing the weight of minimum spanning trees. J. Algorithms (1999)
Ghosh, A., Boyd, S., Saberi, A.: Minimizing effective resistance of a graph. Manuscript (2006)
Jüttner, A.: On budgeted optimization problems. In: Proc. 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 194–203 (2003)
Jain, K., Mahdian, M., Salavatipour, M.: Packing steiner trees. In: SODA, pp. 266–274 (2003)
Kriesell, M.: Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory, Ser. B 88(1), 53–65 (2003)
Lau, L.C.: An approximate max-steiner-tree-packing min-steiner-cut theorem. In: FOCS, pp. 61–70 (2004)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
St, C.: J. A. Nash-Williams. Edge disjoint spanning trees of finite graphs. J. Lond. Math. Soc. (1961)
Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. (1961)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2000)
Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: ICML, pp. 928–936 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakrabarty, D., Mehta, A., Vazirani, V.V. (2006). Design Is as Easy as Optimization. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_42
Download citation
DOI: https://doi.org/10.1007/11786986_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)