Design is as easy as optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 477-488

  Chakrabarty, Deeparnab ^a   Mehta, Aranyak ^b   Vazirani, Vijay V ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; OPTIMIZATION;

DESIGN PROBLEMS; DESIGN VERSION; LEARNING TECHNIQUES OF FREUND-SCHAPIRE [FS99];

PROBLEM SOLVING;

EID: 33746375688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_42     Document Type: Conference Paper

References (17)

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