{"id":"https://openalex.org/W1909158042","doi":"https://doi.org/10.1007/11821069_42","title":"Approximation Algorithms and Hardness Results for Labeled Connectivity Problems","display_name":"Approximation Algorithms and Hardness Results for Labeled Connectivity Problems","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1909158042","doi":"https://doi.org/10.1007/11821069_42","mag":"1909158042"},"language":"en","primary_location":{"id":"doi:10.1007/11821069_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11821069_42","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":true,"oa_status":"green","oa_url":"https://basepub.dauphine.fr/handle/123456789/5583","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022008503","display_name":"Refael Hassin","orcid":"https://orcid.org/0000-0001-9631-6162"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Refael Hassin","raw_affiliation_strings":["School of Mathematical Sciences, Tel-Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080998576","display_name":"J\u00e9r\u00f4me Monnot","orcid":"https://orcid.org/0000-0002-7452-6553"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J\u00e9r\u00f4me Monnot","raw_affiliation_strings":["CNRS\u00a0LAMSADE, Universit\u00e9 Paris-Dauphine, France"],"affiliations":[{"raw_affiliation_string":"CNRS\u00a0LAMSADE, Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044792131","display_name":"Danny Segev","orcid":"https://orcid.org/0000-0003-4684-2185"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Danny Segev","raw_affiliation_strings":["School of Mathematical Sciences, Tel-Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022008503"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2552,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79693795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"480","last_page":"491"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9951000213623047,"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/multigraph","display_name":"Multigraph","score":0.785727322101593},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7119157910346985},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6253427267074585},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5760666728019714},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5725325345993042},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5483459234237671},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.547642707824707},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5059718489646912},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48240792751312256},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4663110673427582},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.454474538564682},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.44690391421318054},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4451022148132324},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43973278999328613},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43960073590278625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41568782925605774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3949279487133026},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13962796330451965},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12027335166931152}],"concepts":[{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.785727322101593},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7119157910346985},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6253427267074585},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5760666728019714},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5725325345993042},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5483459234237671},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.547642707824707},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5059718489646912},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48240792751312256},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4663110673427582},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.454474538564682},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.44690391421318054},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4451022148132324},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43973278999328613},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43960073590278625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41568782925605774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3949279487133026},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13962796330451965},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12027335166931152},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11821069_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11821069_42","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:basepub.dauphine.fr:123456789/5583","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5583","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":{"id":"pmh:oai:basepub.dauphine.fr:123456789/5583","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5583","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1522375947","https://openalex.org/W1909158042","https://openalex.org/W1976157781","https://openalex.org/W1997809628","https://openalex.org/W1998751027","https://openalex.org/W2001139415","https://openalex.org/W2003159902","https://openalex.org/W2011823863","https://openalex.org/W2016001296","https://openalex.org/W2024505010","https://openalex.org/W2030702117","https://openalex.org/W2040924621","https://openalex.org/W2048177396","https://openalex.org/W2072291569","https://openalex.org/W2074117023","https://openalex.org/W2076146651","https://openalex.org/W2080379754","https://openalex.org/W2085720608","https://openalex.org/W2095481180","https://openalex.org/W2130626677","https://openalex.org/W2139317321","https://openalex.org/W2143698439","https://openalex.org/W2144407406","https://openalex.org/W2152221184","https://openalex.org/W2156312014","https://openalex.org/W2163322487","https://openalex.org/W2309179828","https://openalex.org/W2595601445","https://openalex.org/W2610313478"],"related_works":["https://openalex.org/W1868361628","https://openalex.org/W2074881724","https://openalex.org/W2788398742","https://openalex.org/W1997194225","https://openalex.org/W2593615908","https://openalex.org/W2999962451","https://openalex.org/W3155900666","https://openalex.org/W2090863944","https://openalex.org/W2530398396","https://openalex.org/W1909158042"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}