{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:02:28Z","timestamp":1762210948384,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250690"},{"type":"electronic","value":"9783030250706"}],"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-25070-6_7","type":"book-chapter","created":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T23:07:22Z","timestamp":1562886442000},"page":"87-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Understanding the Effectiveness of Data Reduction in Public Transportation Networks"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bl\u00e4sius","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Fischbeck","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Schirneck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for $$d$$-hitting set. J. Comput. Syst. Sci. 76, 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"e85777","DOI":"10.1371\/journal.pone.0085777","volume":"9","author":"J Alstott","year":"2014","unstructured":"Alstott, J., Bullmore, E., Plenz, D.: powerlaw: a Python package for analysis of heavy-tailed distributions. PloS One 9, e85777 (2014)","journal-title":"PloS One"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Fischbeck, P., Friedrich, T., Schirneck, M.: Understanding the effectiveness of data reduction in public transportation networks. arXiv:1905.12477 (2019)","DOI":"10.1007\/978-3-030-25070-6_7"},{"key":"7_CR5","unstructured":"Bringmann, K., Keusch, R., Lengler, J.: Sampling geometric inhomogeneous random graphs in linear time. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA), pp. 20:1\u201320:15 (2017)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-23786-7_19","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"J Davies","year":"2011","unstructured":"Davies, J., Bacchus, F.: Solving MAXSAT by solving a sequence of simpler SAT instances. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 225\u2013239. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_19"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1162\/003355399556133","volume":"114","author":"X Gabaix","year":"1999","unstructured":"Gabaix, X.: Zipf\u2019s law for cities: an explanation. Q. J. Econ. 114, 739\u2013767 (1999)","journal-title":"Q. J. Econ."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gir\u00e1ldez-Cru, J., Levy, J.: Locality in random SAT instances. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 638\u2013644 (2017)","DOI":"10.24963\/ijcai.2017\/89"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.7155\/jgaa.00413","volume":"21","author":"BMP Jansen","year":"2017","unstructured":"Jansen, B.M.P.: On structural parameterizations of hitting set: hitting paths in graphs using 2-SAT. J. Graph Algorithms Appl. 21, 219\u2013243 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1093\/bioinformatics\/btl267","volume":"22","author":"A von Kamp","year":"2006","unstructured":"von Kamp, A., Schuster, S.: Metatool 5.0: fast and flexible elementary modes analysis. Bioinformatics 22, 1930\u20131931 (2006)","journal-title":"Bioinformatics"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogun\u00e1, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82, 036106 (2010)","journal-title":"Phys. Rev. E"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT - the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web (WWW), pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-hitting set. J. Discrete Algorithms 1, 89\u2013102 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1038\/nature11459","volume":"489","author":"F Papadopoulos","year":"2012","unstructured":"Papadopoulos, F., Kitsak, M., Serrano, M.\u00c1., Bogu\u00f1\u00e1, M., Krioukov, D.: Popularity versus similarity in growing networks. Nature 489, 537\u2013540 (2012)","journal-title":"Nature"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/B:CMOT.0000032580.12184.c0","volume":"10","author":"G Robins","year":"2004","unstructured":"Robins, G., Alexander, M.: Small worlds among interlocking directors: network structure and distance in bipartite graphs. Comput. Math. Organ. Theory 10, 69\u201394 (2004)","journal-title":"Comput. Math. Organ. Theory"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5, 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1093\/bioinformatics\/btt195","volume":"29","author":"P Vera-Licona","year":"2013","unstructured":"Vera-Licona, P., Bonnet, E., Barillot, E., Zinovyev, A.: OCSANA: optimal combinations of interventions from network analysis. Bioinformatics 29, 1571\u20131573 (2013)","journal-title":"Bioinformatics"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Voitalov, I., van der Hoorn, P., van der Hofstad, R., Krioukov, D.V.: Scale-free networks well done. arXiv:1811.02071 (2018)","DOI":"10.1103\/PhysRevResearch.1.033034"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"7_CR20","unstructured":"Weihe, K.: Covering trains by stations or the power of data reduction. In: Proceedings of the 1998 Algorithms and Experiments Conference (ALEX), pp. 1\u20138 (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25070-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:19:42Z","timestamp":1710325182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25070-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250690","9783030250706"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25070-6_7","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":"4 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"6 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.ryerson.ca\/waw2019\/","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":"13","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":"9","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":"69% - 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":"1.3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}