{"id":"https://openalex.org/W2087756717","doi":"https://doi.org/10.1007/978-3-642-03685-9_18","title":"Approximating Some Network Design Problems with Node Costs","display_name":"Approximating Some Network Design Problems with Node Costs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2087756717","doi":"https://doi.org/10.1007/978-3-642-03685-9_18","mag":"2087756717"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03685-9_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03685-9_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]},{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Rutgers University, Camden, USA","Rutgers University-Camden"],"affiliations":[{"raw_affiliation_string":"Rutgers University, Camden, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University-Camden","institution_ids":["https://openalex.org/I4210096112"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003622145","display_name":"Zeev Nutov","orcid":"https://orcid.org/0000-0002-6629-3243"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Zeev Nutov","raw_affiliation_strings":["The Open University of Israel, Israel","The Open University of Israel"],"affiliations":[{"raw_affiliation_string":"The Open University of Israel, Israel","institution_ids":["https://openalex.org/I164950643"]},{"raw_affiliation_string":"The Open University of Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056370891"],"corresponding_institution_ids":["https://openalex.org/I102322142","https://openalex.org/I4210096112"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.2787,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89273927,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"231","last_page":"243"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6593507528305054},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6408880949020386},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5443236231803894},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.5129222869873047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5073878169059753},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5036112666130066},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48495033383369446},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.46800747513771057},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.45643699169158936},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4488905370235443},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.42380407452583313},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4144023656845093},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4105476438999176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33487486839294434},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10955962538719177}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6593507528305054},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6408880949020386},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5443236231803894},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.5129222869873047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5073878169059753},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5036112666130066},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48495033383369446},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.46800747513771057},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.45643699169158936},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4488905370235443},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.42380407452583313},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4144023656845093},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4105476438999176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33487486839294434},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10955962538719177},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/978-3-642-03685-9_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03685-9_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.9541","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.9541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/rab/abs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.403.9069","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.9069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.openu.ac.il/home/nutov/MBB-APPROX-09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.7298","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.7298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/rab/TCS-D-09-00472.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.9552","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.9552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/rab/9.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.9813","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.9813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/rab/journal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.412.956","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.412.956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/rab/8.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1517517986","https://openalex.org/W1561826895","https://openalex.org/W1759768216","https://openalex.org/W1948326330","https://openalex.org/W1963899113","https://openalex.org/W1967088945","https://openalex.org/W1967641001","https://openalex.org/W1974888782","https://openalex.org/W1990313671","https://openalex.org/W1996431511","https://openalex.org/W2001139415","https://openalex.org/W2002764437","https://openalex.org/W2003159902","https://openalex.org/W2010912147","https://openalex.org/W2011039300","https://openalex.org/W2016885155","https://openalex.org/W2030458698","https://openalex.org/W2034112563","https://openalex.org/W2034457158","https://openalex.org/W2059149798","https://openalex.org/W2059707428","https://openalex.org/W2079936083","https://openalex.org/W2089897116","https://openalex.org/W2106676868","https://openalex.org/W2117995340","https://openalex.org/W2130626677","https://openalex.org/W2133156969","https://openalex.org/W2142758253","https://openalex.org/W2143996311","https://openalex.org/W2149929647","https://openalex.org/W2151446881","https://openalex.org/W2151534739","https://openalex.org/W2169143327","https://openalex.org/W2171109283","https://openalex.org/W2176619219","https://openalex.org/W2295428206","https://openalex.org/W2340149117","https://openalex.org/W2611804663","https://openalex.org/W3215246336"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W102815760","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}