{"id":"https://openalex.org/W3152988225","doi":"https://doi.org/10.1142/s0129054111009148","title":"APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN","display_name":"APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W3152988225","doi":"https://doi.org/10.1142/s0129054111009148","mag":"3152988225"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054111009148","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111009148","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5051815913","display_name":"Artur Czumaj","orcid":"https://orcid.org/0000-0002-7743-438X"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"ARTUR CZUMAJ","raw_affiliation_strings":["Centre for Discrete Mathematics and its Applications (DIMAP) and Department of Computer Science, University of Warwick, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Discrete Mathematics and its Applications (DIMAP) and Department of Computer Science, University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067736776","display_name":"Jurek Czyzowicz","orcid":"https://orcid.org/0000-0002-9026-1217"},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"JUREK CZYZOWICZ","raw_affiliation_strings":["Departement d'Informatique, Universite du Quebec en Outaouais, Gatineau, Quebec J8X 3X7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departement d'Informatique, Universite du Quebec en Outaouais, Gatineau, Quebec J8X 3X7, Canada","institution_ids":["https://openalex.org/I33217400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052366414","display_name":"Leszek G\u0105sieniec","orcid":"https://orcid.org/0000-0003-1809-9814"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"LESZEK G\u0104SIENIEC","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Peach Street, L69 7ZF, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Peach Street, L69 7ZF, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060626918","display_name":"Jesper Jansson","orcid":"https://orcid.org/0000-0001-6859-8932"},"institutions":[{"id":"https://openalex.org/I114030911","display_name":"Otsuka (Japan)","ror":"https://ror.org/013k5y296","country_code":"JP","type":"company","lineage":["https://openalex.org/I114030911"]},{"id":"https://openalex.org/I26120043","display_name":"Ochanomizu University","ror":"https://ror.org/03599d813","country_code":"JP","type":"education","lineage":["https://openalex.org/I26120043"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"JESPER JANSSON","raw_affiliation_strings":["Ochanomizu University, 2-1-1 Otsuka, Bunkyo-ku, Tokyo-112-8610, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ochanomizu University, 2-1-1 Otsuka, Bunkyo-ku, Tokyo-112-8610, Japan","institution_ids":["https://openalex.org/I114030911","https://openalex.org/I26120043"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"ANDRZEJ LINGAS","raw_affiliation_strings":["Department of Computer Science, Lund University, 22100 Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, 22100 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038614609","display_name":"Pawe\u0142 \u017byli\u0144ski","orcid":"https://orcid.org/0000-0001-6378-7742"},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"PAWEL ZYLINSKI","raw_affiliation_strings":["Institute of Computer Science, University of Gda\u0144sk, 80-952 Gda\u0144sk, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Gda\u0144sk, 80-952 Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I40413290","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":8,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5935,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72379694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"08","first_page":"1949","last_page":"1969"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9987000226974487,"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.9987000226974487,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/euclidean-geometry","display_name":"Euclidean geometry","score":0.6363504528999329},{"id":"https://openalex.org/keywords/geometric-networks","display_name":"Geometric networks","score":0.6091218590736389},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5723960399627686},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5672547817230225},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5611668825149536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5039176344871521},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4910457134246826},{"id":"https://openalex.org/keywords/geometric-design","display_name":"Geometric design","score":0.4454284906387329},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.445119172334671},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44243323802948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.435535728931427},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.42220309376716614},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3903714418411255},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38720959424972534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35306674242019653},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.2641395628452301},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21549645066261292},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10635855793952942}],"concepts":[{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6363504528999329},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.6091218590736389},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5723960399627686},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5672547817230225},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5611668825149536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5039176344871521},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4910457134246826},{"id":"https://openalex.org/C40319758","wikidata":"https://www.wikidata.org/wiki/Q5535477","display_name":"Geometric design","level":2,"score":0.4454284906387329},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.445119172334671},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44243323802948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.435535728931427},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.42220309376716614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3903714418411255},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38720959424972534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35306674242019653},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2641395628452301},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21549645066261292},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10635855793952942},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054111009148","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111009148","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.44999998807907104}],"awards":[{"id":"https://openalex.org/G6958986694","display_name":null,"funder_award_id":"EP/D063191/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W185910453","https://openalex.org/W1994248285","https://openalex.org/W2011039300","https://openalex.org/W2020400310","https://openalex.org/W2035622528","https://openalex.org/W2051290577","https://openalex.org/W2059707428","https://openalex.org/W2060329104","https://openalex.org/W2064086982","https://openalex.org/W2066444425","https://openalex.org/W2075163336","https://openalex.org/W2158686436","https://openalex.org/W2165142526","https://openalex.org/W2324108981","https://openalex.org/W2486715098","https://openalex.org/W2911302472","https://openalex.org/W4246974448"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W2732982824","https://openalex.org/W1443174385","https://openalex.org/W3123730328","https://openalex.org/W1514475159"],"abstract_inverted_index":{"The":[0],"buy-at-bulk":[1,58],"network":[2,34,60],"design":[3,61,79],"problem":[4,62],"has":[5],"been":[6],"extensively":[7],"studied":[8],"in":[9,27],"the":[10,22,38,57],"general":[11,40],"graph":[12],"model.":[13],"In":[14],"this":[15],"paper,":[16],"we":[17,78],"consider":[18],"geometric":[19,59],"versions":[20],"of":[21,56],"problem,":[23],"where":[24],"all":[25],"points":[26],"a":[28,71],"Euclidean":[29],"space":[30],"are":[31],"candidates":[32],"for":[33,42,53,68],"nodes,":[35],"and":[36,74],"present":[37],"first":[39],"approach":[41],"solving":[43],"them.":[44],"It":[45],"enables":[46],"us":[47],"to":[48],"obtain":[49],"quasi-polynomial-time":[50],"approximation":[51,83],"schemes":[52],"basic":[54],"variants":[55],"with":[63,70],"polynomial":[64],"total":[65],"demand.":[66],"Then,":[67],"instances":[69],"single":[72],"sink":[73],"low":[75],"capacity":[76],"links,":[77],"fast":[80],"polynomial-time,":[81],"low-constant":[82],"algorithms.":[84]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}