{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:03:33Z","timestamp":1742954613690,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_12","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"131-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Branching Vertices in Distance-Preserving Subgraphs"],"prefix":"10.1007","author":[{"given":"Kshitij","family":"Gajjar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"12_CR1","unstructured":"Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: New constructions of ($$\\alpha $$, $$\\beta $$)-spanners and purely additive spanners. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 672\u2013681. Society for Industrial and Applied Mathematics (2005)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bodwin, G.: Linear size distance preservers. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 600\u2013615. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.39"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1137\/S0895480103431046","volume":"19","author":"B Bollob\u00e1s","year":"2005","unstructured":"Bollob\u00e1s, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners. SIAM J. Discrete Math. 19(4), 1029\u20131055 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Charikar, M., Leighton, F.T., Li, S., Moitra, A.: Vertex sparsifiers and abstract rounding algorithms. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 265\u2013274, October 2010. https:\/\/doi.org\/10.1109\/FOCS.2010.32","DOI":"10.1109\/FOCS.2010.32"},{"issue":"6","key":"12_CR5","first-page":"1","volume":"37","author":"V Chepoi","year":"2015","unstructured":"Chepoi, V.: Distance-preserving subgraphs of Johnson graphs. Combinatorica 37(6), 1\u201317 (2015)","journal-title":"Combinatorica"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1137\/050630696","volume":"20","author":"D Coppersmith","year":"2006","unstructured":"Coppersmith, D., Elkin, M.: Sparse sourcewise and pairwise distance preservers. SIAM J. Discrete Math. 20(2), 463\u2013501 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR7","unstructured":"D\u00e4ubel, K., Disser, Y., Klimm, M., M\u00fctze, T., Smolny, F.: Distance-preserving graph contractions. CoRR abs\/1705.04544 (2017). http:\/\/arxiv.org\/abs\/1705.04544"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0095-8956(73)90010-5","volume":"14","author":"D\u017d Djokovi\u0107","year":"1973","unstructured":"Djokovi\u0107, D.\u017d.: Distance-preserving subgraphs of hypercubes. J. Comb. Theory Ser. B 14(3), 263\u2013267 (1973)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1137\/130908440","volume":"43","author":"M Englert","year":"2014","unstructured":"Englert, M., Gupta, A., Krauthgamer, R., Rcke, H., Talgam-Cohen, I., Talwar, K.: Vertex sparsifiers: new results from old techniques. SIAM J. Comput. 43(4), 1239\u20131262 (2014). https:\/\/doi.org\/10.1137\/130908440","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jcss.1995.1065","volume":"51","author":"T Feder","year":"1995","unstructured":"Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. J. Comput. System Sci. 51(2), 261\u2013272 (1995). https:\/\/doi.org\/10.1006\/jcss.1995.1065","journal-title":"J. Comput. System Sci."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Filtser, A.: Steiner point removal with distortion $$O (\\log k)$$. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1361\u20131373. Society for Industrial and Applied Mathematics (2018)","DOI":"10.1137\/1.9781611975031.90"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Gajjar, K., Radhakrishnan, J.: Distance-preserving Subgraphs of Interval Graphs. In: 25th Annual European Symposium on Algorithms (ESA 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol. 87, pp. 39:1\u201339:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.39. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7879. http:\/\/arxiv.org\/abs\/1708.03081","DOI":"10.4230\/LIPIcs.ESA.2017.39"},{"key":"12_CR14","unstructured":"Gajjar, K., Radhakrishnan, J.: Minimizing branching vertices in distance-preserving subgraphs. CoRR abs\/1810.11656 (2018). http:\/\/arxiv.org\/abs\/1810.11656"},{"key":"12_CR15","unstructured":"Goranci, G., Henzinger, M., Peng, P.: Improved guarantees for vertex sparsification in planar graphs. arXiv preprint arXiv:1702.01136 (2017)"},{"key":"12_CR16","unstructured":"Gupta, A.: Steiner points in tree metrics don\u2019t (really) help. In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp. 220\u2013227. Society for Industrial and Applied Mathematics (2001)"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/140951382","volume":"44","author":"L Kamma","year":"2015","unstructured":"Kamma, L., Krauthgamer, R., Nguy\u00ean, H.L.: Cutting corners cheaply, or how to remove steiner points. SIAM J. Comput. 44(4), 975\u2013995 (2015)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1137\/120888843","volume":"28","author":"R Krauthgamer","year":"2014","unstructured":"Krauthgamer, R., Nguy\u00ean, H., Zondiner, T.: Preserving terminal distances using minors. SIAM J. Discrete Math. 28(1), 127\u2013141 (2014). https:\/\/doi.org\/10.1137\/120888843","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-642-31594-7_50","volume-title":"Automata, Languages, and Programming","author":"R Krauthgamer","year":"2012","unstructured":"Krauthgamer, R., Zondiner, T.: Preserving terminal distances using minors. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 594\u2013605. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_50"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0022-0000(80)90057-4","volume":"20","author":"AS LaPaugh","year":"1980","unstructured":"LaPaugh, A.S., Rivest, R.L.: The subgraph homeomorphism problem. J. Comput. Syst. Sci. 20(2), 133\u2013149 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Leighton, F.T., Moitra, A.: Extensions and limits to vertex sparsification. In: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC 2010, pp. 47\u201356. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1806689.1806698. https:\/\/doi.acm.org\/10.1145\/1806689.1806698","DOI":"10.1145\/1806689.1806698"},{"key":"12_CR22","series-title":"Lecture Notes in Social Networks","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-7091-1346-2_14","volume-title":"The Influence of Technology on Social Network Analysis and Mining","author":"R Nussbaum","year":"2013","unstructured":"Nussbaum, R., Esfahanian, A.H., Tan, P.N.: Clustering social networks using distance-preserving subgraphs. In: \u00d6zyer, T., Rokne, J., Wagner, G., Reuser, A. (eds.) The Influence of Technology on Social Network Analysis and Mining. LNSN, vol. 6, pp. 331\u2013349. Springer, Vienna (2013). https:\/\/doi.org\/10.1007\/978-3-7091-1346-2_14"},{"issue":"1","key":"12_CR23","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 Theory 13(1), 99\u2013116 (1989). https:\/\/doi.org\/10.1002\/jgt.3190130114","journal-title":"J. Graph Theory"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.is.2017.06.001","volume":"69","author":"A Sadri","year":"2017","unstructured":"Sadri, A., Salim, F.D., Ren, Y., Zameni, M., Chan, J., Sellis, T.: Shrink: distance preserving graph compression. Inf. Syst. 69, 180\u2013193 (2017)","journal-title":"Inf. Syst."},{"issue":"4","key":"12_CR25","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Teng, S.H.: Spectral sparsification of graphs. SIAM J. Comput. 40(4), 981\u20131025 (2011)","journal-title":"SIAM J. Comput."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 802\u2013809. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1145\/1109557.1109645"},{"key":"12_CR27","unstructured":"Yan, D., Cheng, J., Ng, W., Liu, S.: Finding distance-preserving subgraphs in large road networks. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 625\u2013636. IEEE (2013)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:02:16Z","timestamp":1710349336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","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":"71","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":"31","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":"44% - 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","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":"2.27","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)"}}]}}