{"id":"https://openalex.org/W2097945626","doi":"https://doi.org/10.1007/s00493-007-0044-3","title":"An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*","display_name":"An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*","publication_year":2007,"publication_date":"2007-02-01","ids":{"openalex":"https://openalex.org/W2097945626","doi":"https://doi.org/10.1007/s00493-007-0044-3","mag":"2097945626"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-007-0044-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-007-0044-3","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","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/A5032575515","display_name":"L.C. Lau","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Lap Chi Lau\u2020","raw_affiliation_strings":["Department of Computer Science, University of Toronto Sandford Fleming Building, 10 King's College Road, Toronto, Ontario, M5S 3G4, Canada","University of Toronto Sandford Fleming Building, Department of Computer Science, 10 King's College Road, Toronto, Ontario, M5S 3G4, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto Sandford Fleming Building, 10 King's College Road, Toronto, Ontario, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto Sandford Fleming Building, Department of Computer Science, 10 King's College Road, Toronto, Ontario, M5S 3G4, Canada#TAB#","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032575515"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":7.1478,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.97298394,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"1","first_page":"71","last_page":"90"},"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.9987999796867371,"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.9987999796867371,"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.9976999759674072,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8752546310424805},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8689920902252197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8654775619506836},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6327000260353088},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5891472101211548},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5269989371299744},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49034929275512695},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4886608421802521},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4751056134700775},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4550037384033203},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.43823596835136414},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42704224586486816},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41422486305236816},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.27812084555625916},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17478713393211365},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.17047575116157532}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8752546310424805},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8689920902252197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8654775619506836},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6327000260353088},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5891472101211548},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5269989371299744},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49034929275512695},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4886608421802521},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4751056134700775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4550037384033203},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.43823596835136414},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42704224586486816},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41422486305236816},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.27812084555625916},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17478713393211365},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.17047575116157532},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00493-007-0044-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-007-0044-3","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1526553713","https://openalex.org/W1529755670","https://openalex.org/W1549924504","https://openalex.org/W1786780942","https://openalex.org/W1964510837","https://openalex.org/W1967786783","https://openalex.org/W1986798241","https://openalex.org/W1990327548","https://openalex.org/W2016764804","https://openalex.org/W2029140734","https://openalex.org/W2041430500","https://openalex.org/W2042706982","https://openalex.org/W2045928065","https://openalex.org/W2049513883","https://openalex.org/W2056643949","https://openalex.org/W2058858486","https://openalex.org/W2066088944","https://openalex.org/W2070664846","https://openalex.org/W2073105533","https://openalex.org/W2080978495","https://openalex.org/W2082591111","https://openalex.org/W2090492366","https://openalex.org/W2094710049","https://openalex.org/W2105781905","https://openalex.org/W2119772493","https://openalex.org/W2128249405","https://openalex.org/W2140498229","https://openalex.org/W2150148016","https://openalex.org/W2155858227","https://openalex.org/W2920849150","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W974563791","https://openalex.org/W2009976792","https://openalex.org/W1980288485","https://openalex.org/W1998126097","https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W3184075718","https://openalex.org/W2404561224","https://openalex.org/W1533142511","https://openalex.org/W2900469667"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}