{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:32:48Z","timestamp":1743125568245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030808785"},{"type":"electronic","value":"9783030808792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80879-2_7","type":"book-chapter","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T08:10:56Z","timestamp":1625472656000},"page":"97-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lasserre Integrality Gaps for Graph Spanners and Related Problems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[]},{"given":"Yasamin","family":"Nazari","sequence":"additional","affiliation":[]},{"given":"Zeyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81\u2013100 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR2","unstructured":"Babay, A., Dinitz, M., Zhang, Z.: Characterizing demand graphs for (fixed-parameter) shallow-light steiner network. arXiv preprint arXiv:1802.10566 (2018)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation. In: Proceedings of the 2011 IEEE 52Nd Annual Symposium on Foundations of Computer Science, pp. 472\u2013481. FOCS 2011 (2011)","DOI":"10.1109\/FOCS.2011.95"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ic.2012.10.007","volume":"222","author":"P Berman","year":"2013","unstructured":"Berman, P., Bhattacharyya, A., Makarychev, K., Raskhodnikova, S., Yaroslavtsev, G.: Approximation algorithms for spanner problems and directed Steiner forest. Inf. Comput. 222, 93\u2013107 (2013)","journal-title":"Inf. Comput."},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1137\/110826655","volume":"41","author":"A Bhattacharyya","year":"2012","unstructured":"Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. SIAM J. Comput. 41(6), 1380\u20131425 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s00453-010-9464-3","volume":"61","author":"M Charikar","year":"2011","unstructured":"Charikar, M., Hajiaghayi, M., Karloff, H.J.: Improved approximation algorithms for label cover problems. Algorithmica 61(1), 190\u2013206 (2011)","journal-title":"Algorithmica"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Near-optimal algorithms for unique games. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, pp. 205\u2013214. STOC 2006 (2006)","DOI":"10.1145\/1132516.1132547"},{"issue":"15","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a015","volume":"12","author":"E Chlamt\u00e1\u010d","year":"2016","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M.: Lowest-degree $$k$$-spanner: approximation and hardness. Theor. Comput. 12(15), 1\u201329 (2016)","journal-title":"Theor. Comput."},{"key":"7_CR9","unstructured":"Chlamt\u00e1c, E., Dinitz, M., Robinson, T.: Approximating the Norms of Graph Spanners. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 145, pp. 11:1\u201311:22 (2019)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1c, E., Manurangsi, P., Moshkovitz, D., Vijayaraghavan, A.: Approximation algorithms for label cover and the log-density threshold. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2017 (2017)","DOI":"10.1137\/1.9781611974782.57"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Kortsarz, G., Laekhanukit, B.: Approximating spanners and directed Steiner forest: upper and lower bounds. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2017 (2017)","DOI":"10.1137\/1.9781611974782.34"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Krauthgamer, R.: Everywhere-sparse spanners via dense subgraphs. In: Proceedings of the 53rd IEEE Annual Symposium on Foundations of Computer Science, pp. 758\u2013767. FOCS 2012 (2012)","DOI":"10.1109\/FOCS.2012.61"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Kortsarz, G., Raz, R.: Label cover instances with large girth and the hardness of approximating basic k-spanner. ACM Trans. Algorithms 12(2), 25:1\u201325:16 (2015)","DOI":"10.1145\/2818375"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Krauthgamer, R.: Directed spanners via flow-based linear programs. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, pp. 323\u2013332. STOC 2011 (2011)","DOI":"10.1145\/1993636.1993680"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Krauthgamer, R.: Fault-tolerant spanners: better and simpler. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 169\u2013178. PODC 2011 (2011)","DOI":"10.1145\/1993806.1993830"},{"key":"7_CR16","unstructured":"Dinitz, M., Nazari, Y., Zhang, Z.: Lasserre integrality gaps for graph spanners and related problems. CoRR abs\/1905.07468 (2019). http:\/\/arxiv.org\/abs\/1905.07468"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Zhang, Z.: Approximating low-stretch spanners. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA (2016)","DOI":"10.1137\/1.9781611974331.ch59"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00224-006-1266-2","volume":"41","author":"M Elkin","year":"2007","unstructured":"Elkin, M., Peleg, D.: The hardness of approximating spanner problems. Theor. Comput. Syst. 41(4), 691\u2013729 (2007)","journal-title":"Theor. Comput. Syst."},{"key":"7_CR19","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: Theory Graphs and its Applications: Proceedings of the Symposium held in Smolenice 1963, pp. 29\u201336 (1964)"},{"issue":"6","key":"7_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/3231591","volume":"65","author":"S Friedrichs","year":"2018","unstructured":"Friedrichs, S., Lenzen, C.: Parallel metric tree embedding based on an algebraic view on Moore-Bellman-Ford. J. ACM (JACM) 65(6), 43 (2018)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/s00453-001-0021-y","volume":"30","author":"G Kortsarz","year":"2001","unstructured":"Kortsarz, G.: On the hardness of approximating spanners. Algorithmica 30(3), 432\u2013450 (2001)","journal-title":"Algorithmica"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293\u2013303. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_23"},{"issue":"3","key":"7_CR23","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the sherali-adams, lov\u00e1sz-schrijver, and lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"7_CR24","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"7_CR25","unstructured":"Manurangsi, P.: On approximating projection games. Master\u2019s thesis, Massachusetts Institute of Technology (2015)"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. J. Graph Theor. 13(1), 99\u2013116 (1989)","journal-title":"J. Graph Theor."},{"issue":"4","key":"7_CR27","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18(4), 740\u2013747 (1989)","journal-title":"SIAM J. Comput."},{"key":"7_CR28","unstructured":"Rothvo\u00df, T.: The Lasserre hierarchy in approximation algorithms. Lecture Notes for the MAPSP, pp. 1\u201325 (2013)"},{"issue":"3","key":"7_CR29","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discret. Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 1\u201310. ACM (2001)","DOI":"10.1145\/378580.378581"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Tulsiani, M.: CSP gaps and reductions in the Lasserre hierarchy. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 303\u2013312. ACM (2009)","DOI":"10.1145\/1536414.1536457"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80879-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T22:04:13Z","timestamp":1638396253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80879-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030808785","9783030808792"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80879-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2020.di.unipi.it\/WAOA2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.125","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.95","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}