{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:02Z","timestamp":1725472022722},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_42","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"477-488","source":"Crossref","is-referenced-by-count":5,"title":["Design Is as Easy as Optimization"],"prefix":"10.1007","author":[{"given":"Deeparnab","family":"Chakrabarty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay V.","family":"Vazirani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Barahona, F., Baiou, M.: A linear programming approach to increasing the weight of all minimum spanning trees. In: INFORMS (2005)"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Boyd, S., Diaconis, P., Xiao, L.: The fastest mixing markov chain on a graph. In: SIAM Review (2004)","DOI":"10.1137\/S0036144503423264"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"LATIN 2004: Theoretical Informatics","author":"J. Elson","year":"2004","unstructured":"Elson, J., Karp, R., Papadimitriou, C., Shenker, S.: Global synchronization in sensornets. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, Springer, Heidelberg (2004)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Impagliazzo, R., Kabanets, V., Umans, C.: On the complexity of succinct zero-sum games. In: IEEE Conference on Computational Complexity, pp. 323\u2013332 (2005)","DOI":"10.1109\/CCC.2005.18"},{"key":"42_CR5","unstructured":"Flaxman, A., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: SODA (2005)"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.: Adaptive game playing using multiplicative weights. Games and Economic Behavior\u00a029, 79\u2013103 (1999)","journal-title":"Games and Economic Behavior"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Frederickson, G., Solis-Oba, R.: Increasing the weight of minimum spanning trees. J. Algorithms (1999)","DOI":"10.1006\/jagm.1999.1026"},{"key":"42_CR8","unstructured":"Ghosh, A., Boyd, S., Saberi, A.: Minimizing effective resistance of a graph. Manuscript (2006)"},{"key":"42_CR9","unstructured":"J\u00fcttner, A.: On budgeted optimization problems. In: Proc. 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 194\u2013203 (2003)"},{"key":"42_CR10","unstructured":"Jain, K., Mahdian, M., Salavatipour, M.: Packing steiner trees. In: SODA, pp. 266\u2013274 (2003)"},{"issue":"1","key":"42_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0095-8956(02)00013-8","volume":"B 88","author":"M. Kriesell","year":"2003","unstructured":"Kriesell, M.: Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory, Ser.\u00a0B 88(1), 53\u201365 (2003)","journal-title":"J. Comb. Theory, Ser."},{"key":"42_CR12","unstructured":"Lau, L.C.: An approximate max-steiner-tree-packing min-steiner-cut theorem. In: FOCS, pp. 61\u201370 (2004)"},{"key":"42_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"St, C.: J.\u00a0A. Nash-Williams. Edge disjoint spanning trees of finite graphs. J. Lond. Math. Soc. (1961)","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. (1961)","DOI":"10.1112\/jlms\/s1-36.1.221"},{"key":"42_CR16","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2000","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2000)"},{"key":"42_CR17","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: ICML, pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:19:51Z","timestamp":1619493591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11786986_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}