{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:47:45Z","timestamp":1765176465019},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_20","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T02:39:51Z","timestamp":1250822391000},"page":"258-271","source":"Crossref","is-referenced-by-count":17,"title":["Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy"],"prefix":"10.1007","author":[{"given":"Avner","family":"Magen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Moharrami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"554","volume-title":"FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997)","author":"S. Arora","year":"1997","unstructured":"Arora, S.: Nearly linear time approximation schemes for euclidean tsp and other geometric problems. In: FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), Washington, DC, USA, p. 554. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.orl.2007.09.003","volume":"36","author":"D. Bienstock","year":"2008","unstructured":"Bienstock, D.: Approximate formulations for 0-1 knapsack sets. Oper. Res. Lett.\u00a036(3), 317\u2013320 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1-2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR5","unstructured":"Borradaile, G., Kenyon-Mathieu, C., Klein, P.N.: A polynomial-time approximation scheme for steiner tree in planar graphs. In: SODA, pp. 1285\u20131294 (2007)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P., Mathieu, C.: A polynomial-time approximation scheme for euclidean steiner forest. In: FOCS (2008)","DOI":"10.1109\/FOCS.2008.59"},{"key":"20_CR7","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Integrality gaps for Sherali-Adams relaxations (manuscript) (2007)"},{"key":"20_CR8","unstructured":"C\u0103linescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. In: SODA 1996: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 16\u201325 (1996)"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.disopt.2004.03.002","volume":"1","author":"N.O.D. Bienstock","year":"2004","unstructured":"Bienstock, N.O.D.: Tree-width and the sherali-adams operator. Discrete Optimization\u00a01(1), 13\u201321 (2004)","journal-title":"Discrete Optimization"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-003-0423-5","volume":"97","author":"J.U.D. Avis","year":"2003","unstructured":"Avis, J.U.D.: Stronger linear programming relaxations of max-cut. Mathematical Programming\u00a097(3), 451\u2013469 (2003)","journal-title":"Mathematical Programming"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jctb.2003.09.001","volume":"91","author":"M. DeVos","year":"2004","unstructured":"DeVos, M., Ding, G., Oporowski, B., Sanders, D.P., Reed, B., Seymour, P., Vertigan, D.: Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory Ser. B\u00a091(1), 25\u201341 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"20_CR12","unstructured":"Kawarabayashi, K.-i., Demaine, E.D., Hajiaghayi, M.T.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: FOCS, pp. 637\u2013646 (2005)"},{"key":"20_CR13","unstructured":"Feige, U.: On allocations that maximize fairness. In: SODA 2008: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, San Francisco, California, pp. 287\u2013293 (2008)"},{"key":"20_CR14","unstructured":"de la Vega, W.F., Kenyon-Mathieu, C.: Linear programming relaxations of maxcut. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (2007)"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00493-003-0037-9","volume":"23","author":"M. Grohe","year":"2003","unstructured":"Grohe, M.: Local tree-width, excluded minors, and approximation algorithms. Combinatorica\u00a023(4), 613\u2013632 (2003)","journal-title":"Combinatorica"},{"key":"20_CR16","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1998","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1998)"},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. In: FOCS, pp. 206\u2013213 (1977)","DOI":"10.1109\/SFCS.1977.11"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Cambridge Math. Proc. Cambridge Philos. Soc.\u00a095, 261\u2013265 (1984)","journal-title":"Math. Proc. Cambridge Math. Proc. Cambridge Philos. Soc."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node and edge deletion np-complete problems. In: STOC, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:14:32Z","timestamp":1558282472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}