{"id":"https://openalex.org/W2014708079","doi":"https://doi.org/10.1007/s10878-014-9774-5","title":"Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph","display_name":"Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph","publication_year":2014,"publication_date":"2014-08-12","ids":{"openalex":"https://openalex.org/W2014708079","doi":"https://doi.org/10.1007/s10878-014-9774-5","mag":"2014708079"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-014-9774-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-014-9774-5","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/A5080863479","display_name":"Mohammad Reza Khani","orcid":"https://orcid.org/0000-0001-7753-1780"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Reza Khani","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College park, United States","Dept. of Computer Science, University of Maryland College Park, United States"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College park, United States","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Maryland College Park, United States","institution_ids":["https://openalex.org/I66946132"]}]},{"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, Edmonton, Alberta\u00a0, T6G 2E8, Canada","Department of Computing Science, University of Alberta, Edmonton, Canada T6G-2E8"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, Alberta\u00a0, T6G 2E8, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, Canada T6G-2E8","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080863479"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.3675,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62556682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"2","first_page":"669","last_page":"685"},"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.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/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/T10374","display_name":"Advanced Graph Theory Research","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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9947999715805054,"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/combinatorics","display_name":"Combinatorics","score":0.8295981287956238},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8205070495605469},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.682012677192688},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5262864232063293},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.503189742565155},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.459943026304245},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4567173719406128},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4420003890991211},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43450018763542175},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36146315932273865},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13123008608818054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0641661286354065}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8295981287956238},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8205070495605469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.682012677192688},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5262864232063293},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.503189742565155},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.459943026304245},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4567173719406128},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4420003890991211},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43450018763542175},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36146315932273865},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13123008608818054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0641661286354065},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/s10878-014-9774-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-014-9774-5","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:RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9774-5","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-014-9774-5","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W198434069","https://openalex.org/W1482405521","https://openalex.org/W1506243241","https://openalex.org/W1558839671","https://openalex.org/W1575625195","https://openalex.org/W1965957777","https://openalex.org/W1974713906","https://openalex.org/W1989669912","https://openalex.org/W1998327496","https://openalex.org/W1998678640","https://openalex.org/W2020400310","https://openalex.org/W2030365814","https://openalex.org/W2034112563","https://openalex.org/W2034457158","https://openalex.org/W2038190710","https://openalex.org/W2041571997","https://openalex.org/W2051629298","https://openalex.org/W2059707428","https://openalex.org/W2066590823","https://openalex.org/W2079936083","https://openalex.org/W2087756717","https://openalex.org/W2087937221","https://openalex.org/W2088648195","https://openalex.org/W2089897116","https://openalex.org/W2097181193","https://openalex.org/W2098907131","https://openalex.org/W2108573551","https://openalex.org/W2130626677","https://openalex.org/W2133156969","https://openalex.org/W2142779979","https://openalex.org/W2147258429","https://openalex.org/W2149929647","https://openalex.org/W2161190897","https://openalex.org/W2163150343","https://openalex.org/W2169143327","https://openalex.org/W2172955861","https://openalex.org/W2623734410","https://openalex.org/W2952763838","https://openalex.org/W2988480584","https://openalex.org/W3030774092","https://openalex.org/W4241239065"],"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/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W3184075718","https://openalex.org/W2404561224"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
