{"id":"https://openalex.org/W2591403913","doi":"https://doi.org/10.1007/s00453-017-0391-4","title":"Online Constrained Forest and Prize-Collecting Network Design","display_name":"Online Constrained Forest and Prize-Collecting Network Design","publication_year":2017,"publication_date":"2017-10-30","ids":{"openalex":"https://openalex.org/W2591403913","doi":"https://doi.org/10.1007/s00453-017-0391-4","mag":"2591403913"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0391-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0391-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/A5100806726","display_name":"Jiawei Qian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiawei Qian","raw_affiliation_strings":["JW Capital, Beijing, China"],"affiliations":[{"raw_affiliation_string":"JW Capital, Beijing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066531115","display_name":"Seeun William Umboh","orcid":"https://orcid.org/0000-0001-6984-4007"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Seeun William Umboh","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667154","display_name":"David P. Williamson","orcid":"https://orcid.org/0000-0002-2884-0058"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David P. Williamson","raw_affiliation_strings":["School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, 14853, USA"],"affiliations":[{"raw_affiliation_string":"School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, 14853, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043667154"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4374,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.65369644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"80","issue":"11","first_page":"3335","last_page":"3364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},{"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.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6283731460571289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5350350737571716},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3290547728538513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23424580693244934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18788442015647888}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6283731460571289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5350350737571716},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3290547728538513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23424580693244934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18788442015647888}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-017-0391-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0391-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"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/91eed7fc-1623-466b-ae10-b3453772e0b1","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/91eed7fc-1623-466b-ae10-b3453772e0b1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Qian, J, Umboh, S W & Williamson, D P 2018, 'Online constrained forest and prize-collecting network design', Algorithmica, vol. 80, no. 11, pp. 3335\u20133364. https://doi.org/10.1007/s00453-017-0391-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/91eed7fc-1623-466b-ae10-b3453772e0b1","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/91eed7fc-1623-466b-ae10-b3453772e0b1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 80(11). Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5329971192","display_name":null,"funder_award_id":"1115256","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1517384480","https://openalex.org/W1522825644","https://openalex.org/W1864228528","https://openalex.org/W1971222832","https://openalex.org/W1974542877","https://openalex.org/W1981114903","https://openalex.org/W1985672402","https://openalex.org/W1989224473","https://openalex.org/W2001139415","https://openalex.org/W2004415919","https://openalex.org/W2011232221","https://openalex.org/W2011823863","https://openalex.org/W2029437526","https://openalex.org/W2037408498","https://openalex.org/W2043905543","https://openalex.org/W2044119054","https://openalex.org/W2071608792","https://openalex.org/W2110681594","https://openalex.org/W2271728747","https://openalex.org/W2401610261","https://openalex.org/W2610631890","https://openalex.org/W2949813243","https://openalex.org/W3153460966","https://openalex.org/W4249586771","https://openalex.org/W6653086227"],"related_works":["https://openalex.org/W1988596123","https://openalex.org/W3003496213","https://openalex.org/W3046485619","https://openalex.org/W1983292127","https://openalex.org/W1983165119","https://openalex.org/W2094847482","https://openalex.org/W2205929132","https://openalex.org/W2133477672","https://openalex.org/W2800941031","https://openalex.org/W2522527288"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}