Advertisement

Design Is as Easy as Optimization

  • Deeparnab Chakrabarty
  • Aranyak Mehta
  • Vijay V. Vazirani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4051)

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.

Keywords

Design Problem Steiner Tree Fractional Packing Commute Time Design Version 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BB05]
    Barahona, F., Baiou, M.: A linear programming approach to increasing the weight of all minimum spanning trees. In: INFORMS (2005)Google Scholar
  2. [BDX04]
    Boyd, S., Diaconis, P., Xiao, L.: The fastest mixing markov chain on a graph. In: SIAM Review (2004)Google Scholar
  3. [EKPS04]
    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)Google Scholar
  4. [FIKU05]
    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)Google Scholar
  5. [FKM05]
    Flaxman, A., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: SODA (2005)Google Scholar
  6. [FS99]
    Freund, Y., Schapire, R.: Adaptive game playing using multiplicative weights. Games and Economic Behavior 29, 79–103 (1999)MATHCrossRefMathSciNetGoogle Scholar
  7. [FSO99]
    Frederickson, G., Solis-Oba, R.: Increasing the weight of minimum spanning trees. J. Algorithms (1999)Google Scholar
  8. [GBS06]
    Ghosh, A., Boyd, S., Saberi, A.: Minimizing effective resistance of a graph. Manuscript (2006)Google Scholar
  9. [J0̈3]
    Jüttner, A.: On budgeted optimization problems. In: Proc. 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 194–203 (2003)Google Scholar
  10. [JMS03]
    Jain, K., Mahdian, M., Salavatipour, M.: Packing steiner trees. In: SODA, pp. 266–274 (2003)Google Scholar
  11. [Kri03]
    Kriesell, M.: Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory, Ser. B 88(1), 53–65 (2003)CrossRefMathSciNetGoogle Scholar
  12. [Lau04]
    Lau, L.C.: An approximate max-steiner-tree-packing min-steiner-cut theorem. In: FOCS, pp. 61–70 (2004)Google Scholar
  13. [MR95]
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)MATHGoogle Scholar
  14. [NW61]
    St, C.: J. A. Nash-Williams. Edge disjoint spanning trees of finite graphs. J. Lond. Math. Soc. (1961)Google Scholar
  15. [Tut61]
    Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. (1961)Google Scholar
  16. [Vaz00]
    Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2000)Google Scholar
  17. [Zin03]
    Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: ICML, pp. 928–936 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Deeparnab Chakrabarty
    • 1
  • Aranyak Mehta
    • 2
  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyAtlantaUSA
  2. 2.IBM Almaden Research CenterSan JoseUSA

Personalised recommendations