{"id":"https://openalex.org/W2050873015","doi":"https://doi.org/10.1007/s10878-009-9256-3","title":"Approximating k-generalized connectivity via\u00a0collapsing HSTs","display_name":"Approximating k-generalized connectivity via\u00a0collapsing HSTs","publication_year":2009,"publication_date":"2009-07-30","ids":{"openalex":"https://openalex.org/W2050873015","doi":"https://doi.org/10.1007/s10878-009-9256-3","mag":"2050873015"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-009-9256-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-009-9256-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","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/A5044792131","display_name":"Danny Segev","orcid":"https://orcid.org/0000-0003-4684-2185"},"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":true,"raw_author_name":"Danny Segev","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","Sloan School of Management, Massachusetts Institute of Technology, Cambridge, USA 02139"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, USA 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044792131"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.1185464,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"3","first_page":"364","last_page":"382"},"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.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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.9898999929428101,"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/combinatorics","display_name":"Combinatorics","score":0.6532670855522156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6082488894462585},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6082243919372559},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5896898508071899},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5871069431304932},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5654088854789734},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5398745536804199},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5111566185951233},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4772776961326599},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4514060914516449},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42959997057914734},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4278582036495209},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4272986948490143},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.41459351778030396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33213162422180176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19712501764297485}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6532670855522156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6082488894462585},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6082243919372559},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5896898508071899},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5871069431304932},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5654088854789734},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5398745536804199},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5111566185951233},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4772776961326599},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4514060914516449},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42959997057914734},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4278582036495209},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4272986948490143},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.41459351778030396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33213162422180176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19712501764297485},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"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/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":3,"locations":[{"id":"doi:10.1007/s10878-009-9256-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-009-9256-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.8217","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.8217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://stat.haifa.ac.il/~segevd/Papers/Gen-Forest-Full.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:jcomop:v:21:y:2011:i:3:d:10.1007_s10878-009-9256-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-009-9256-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W1499673022","https://openalex.org/W1500932665","https://openalex.org/W1504535901","https://openalex.org/W1517517986","https://openalex.org/W1528210381","https://openalex.org/W1530239281","https://openalex.org/W1544515183","https://openalex.org/W1591968161","https://openalex.org/W1636182933","https://openalex.org/W1971222832","https://openalex.org/W1973444128","https://openalex.org/W1973602133","https://openalex.org/W1974542877","https://openalex.org/W1981114903","https://openalex.org/W1990313671","https://openalex.org/W1990571240","https://openalex.org/W1994698869","https://openalex.org/W2001139415","https://openalex.org/W2009976792","https://openalex.org/W2011823863","https://openalex.org/W2014979132","https://openalex.org/W2016332468","https://openalex.org/W2018511415","https://openalex.org/W2020400310","https://openalex.org/W2025050335","https://openalex.org/W2032279394","https://openalex.org/W2032321507","https://openalex.org/W2034543148","https://openalex.org/W2036569687","https://openalex.org/W2036836182","https://openalex.org/W2037408498","https://openalex.org/W2038225707","https://openalex.org/W2039298646","https://openalex.org/W2041571997","https://openalex.org/W2065641139","https://openalex.org/W2078850190","https://openalex.org/W2084415648","https://openalex.org/W2097181193","https://openalex.org/W2114493937","https://openalex.org/W2139230981","https://openalex.org/W2142779979","https://openalex.org/W2148352980","https://openalex.org/W2149929647","https://openalex.org/W2151534739","https://openalex.org/W2153952206","https://openalex.org/W2155148197","https://openalex.org/W2163150343","https://openalex.org/W2164756925","https://openalex.org/W2167816765","https://openalex.org/W2173641041","https://openalex.org/W2295961103","https://openalex.org/W2610052675","https://openalex.org/W2767048380","https://openalex.org/W2799693456","https://openalex.org/W2950368606","https://openalex.org/W3030774092","https://openalex.org/W4244296663","https://openalex.org/W4252017042"],"related_works":["https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W2136838521","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W2952838392","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}