{"id":"https://openalex.org/W2154295079","doi":"https://doi.org/10.1007/s00453-005-1188-4","title":"Hardness and approximation results for packing steiner trees","display_name":"Hardness and approximation results for packing steiner trees","publication_year":2006,"publication_date":"2006-02-15","ids":{"openalex":"https://openalex.org/W2154295079","doi":"https://doi.org/10.1007/s00453-005-1188-4","mag":"2154295079"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-005-1188-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-005-1188-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5046805470","display_name":"Joseph Cheriyan","orcid":"https://orcid.org/0000-0003-0316-7650"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Joseph Cheriyan","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":["Department of Computing Science, University of Alberta, T6G 2E8, Edmonton, Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, T6G 2E8, Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046805470"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.0335,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.91578622,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"45","issue":"1","first_page":"21","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9213383197784424},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8452491760253906},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7370212078094482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6830586791038513},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6476132273674011},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6298201680183411},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5251821279525757},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4622063636779785},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.453920841217041},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43450862169265747},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1980423629283905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1710335910320282}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9213383197784424},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8452491760253906},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7370212078094482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6830586791038513},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6476132273674011},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6298201680183411},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5251821279525757},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4622063636779785},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.453920841217041},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43450862169265747},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1980423629283905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1710335910320282},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-005-1188-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-005-1188-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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":28,"referenced_works":["https://openalex.org/W20058877","https://openalex.org/W204341840","https://openalex.org/W1514881936","https://openalex.org/W1515157528","https://openalex.org/W1526553713","https://openalex.org/W1590025341","https://openalex.org/W1607066202","https://openalex.org/W1783295460","https://openalex.org/W1963899113","https://openalex.org/W1967786783","https://openalex.org/W1974115975","https://openalex.org/W1990313671","https://openalex.org/W2005509629","https://openalex.org/W2009976792","https://openalex.org/W2016764804","https://openalex.org/W2034269606","https://openalex.org/W2047723482","https://openalex.org/W2049513883","https://openalex.org/W2056643949","https://openalex.org/W2071016718","https://openalex.org/W2095251431","https://openalex.org/W2097945626","https://openalex.org/W2107819530","https://openalex.org/W2134386654","https://openalex.org/W2155766772","https://openalex.org/W2569646339","https://openalex.org/W2798588639","https://openalex.org/W2912794399"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}