{"id":"https://openalex.org/W2144474663","doi":"https://doi.org/10.1007/978-3-642-22006-7_1","title":"Improved Approximation for the Directed Spanner Problem","display_name":"Improved Approximation for the Directed Spanner Problem","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2144474663","doi":"https://doi.org/10.1007/978-3-642-22006-7_1","mag":"2144474663"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-22006-7_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22006-7_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023910624","display_name":"Piotr Berman","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Piotr Berman","raw_affiliation_strings":["Pennsylvania State University, USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102919901","display_name":"Arnab Bhattacharyya","orcid":"https://orcid.org/0000-0002-3648-5957"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arnab Bhattacharyya","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033681881","display_name":"Konstantin Makarychev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Konstantin Makarychev","raw_affiliation_strings":["IBM T.J.\u00a0Watson Research Center, USA"],"affiliations":[{"raw_affiliation_string":"IBM T.J.\u00a0Watson Research Center, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080839778","display_name":"Sofya Raskhodnikova","orcid":"https://orcid.org/0000-0002-4902-050X"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sofya Raskhodnikova","raw_affiliation_strings":["Pennsylvania State University, USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001984674","display_name":"Grigory Yaroslavtsev","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grigory Yaroslavtsev","raw_affiliation_strings":["Pennsylvania State University, USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5023910624"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.4679,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.9284033,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.9250718355178833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7932873964309692},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6160106658935547},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5345638990402222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47413110733032227},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4728189706802368},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4571636915206909},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3486263155937195},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3229522705078125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28039178252220154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22836297750473022}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.9250718355178833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7932873964309692},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6160106658935547},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5345638990402222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47413110733032227},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4728189706802368},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4571636915206909},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3486263155937195},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3229522705078125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28039178252220154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22836297750473022},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-22006-7_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22006-7_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.229.2529","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.2529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.psu.edu/%7Esofya/pubs/directed-spanners.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.360.1895","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.1895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://grigory.us/files/publications/directed-spanners-journal-submitted.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.360.871","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://grigory.us/files/k-spanner-algo-ICALP2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1486613786","https://openalex.org/W1492237614","https://openalex.org/W1517517986","https://openalex.org/W1534368076","https://openalex.org/W1562956125","https://openalex.org/W1565009874","https://openalex.org/W1632764828","https://openalex.org/W1971316210","https://openalex.org/W1997369416","https://openalex.org/W1998721609","https://openalex.org/W2002041206","https://openalex.org/W2002296715","https://openalex.org/W2018963243","https://openalex.org/W2022092881","https://openalex.org/W2038973759","https://openalex.org/W2044989918","https://openalex.org/W2045446569","https://openalex.org/W2056403031","https://openalex.org/W2057046770","https://openalex.org/W2057994027","https://openalex.org/W2060054375","https://openalex.org/W2077824753","https://openalex.org/W2085630237","https://openalex.org/W2091569826","https://openalex.org/W2097747425","https://openalex.org/W2108967854","https://openalex.org/W2121615984","https://openalex.org/W2128087748","https://openalex.org/W2148137544","https://openalex.org/W2157760787","https://openalex.org/W2620939520","https://openalex.org/W2950087390","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W4240054244","https://openalex.org/W2242006561","https://openalex.org/W2962992394","https://openalex.org/W2486585506","https://openalex.org/W2107689258","https://openalex.org/W1991979416","https://openalex.org/W2593080689","https://openalex.org/W4205854323","https://openalex.org/W2115855742","https://openalex.org/W2254726702"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}