{"id":"https://openalex.org/W1537274075","doi":"https://doi.org/10.1007/3-540-46541-3_31","title":"The Hardness of Approximating Spanner Problems","display_name":"The Hardness of Approximating Spanner Problems","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1537274075","doi":"https://doi.org/10.1007/3-540-46541-3_31","mag":"1537274075"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46541-3_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46541-3_31","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":"conference-paper","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/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100, Israel","The Weizmann Inst. of Sci"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"The Weizmann Inst. of Sci","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100, Israel","The Weizmann Inst. of Sci"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"The Weizmann Inst. of Sci","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0336,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.72718204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"370","last_page":"381"},"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.9994000196456909,"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.9994000196456909,"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.9968000054359436,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.9879356026649475},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6217508316040039},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6090264916419983},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6032116413116455},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5167590975761414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47088250517845154},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.47037404775619507},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.44519174098968506},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4347999393939972},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3660619854927063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35581010580062866},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1231168806552887},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12189751863479614}],"concepts":[{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.9879356026649475},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6217508316040039},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6090264916419983},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6032116413116455},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5167590975761414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47088250517845154},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.47037404775619507},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.44519174098968506},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4347999393939972},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3660619854927063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35581010580062866},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1231168806552887},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12189751863479614},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-46541-3_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46541-3_31","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","display_name":"Climate action","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W138091770","https://openalex.org/W225145913","https://openalex.org/W1489900072","https://openalex.org/W1491725382","https://openalex.org/W1510730180","https://openalex.org/W1511716344","https://openalex.org/W1534368076","https://openalex.org/W1562956125","https://openalex.org/W1590377549","https://openalex.org/W1976125024","https://openalex.org/W1990313671","https://openalex.org/W2006271335","https://openalex.org/W2016232593","https://openalex.org/W2018963243","https://openalex.org/W2022092881","https://openalex.org/W2024505010","https://openalex.org/W2041167985","https://openalex.org/W2057046770","https://openalex.org/W2130052388","https://openalex.org/W2141741604","https://openalex.org/W2229954659","https://openalex.org/W2912638782","https://openalex.org/W4210731599","https://openalex.org/W4245082111","https://openalex.org/W4248999634"],"related_works":["https://openalex.org/W4240054244","https://openalex.org/W2912638782","https://openalex.org/W4287999588","https://openalex.org/W2993304180","https://openalex.org/W3082881870","https://openalex.org/W3035713054","https://openalex.org/W2033607935","https://openalex.org/W2486585506","https://openalex.org/W2242006561","https://openalex.org/W2962992394"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}