{"id":"https://openalex.org/W1975361422","doi":"https://doi.org/10.1007/s10878-005-1412-9","title":"The Polymatroid Steiner Problems","display_name":"The Polymatroid Steiner Problems","publication_year":2005,"publication_date":"2005-05-01","ids":{"openalex":"https://openalex.org/W1975361422","doi":"https://doi.org/10.1007/s10878-005-1412-9","mag":"1975361422"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-005-1412-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1412-9","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/A5030046558","display_name":"Grui\u0103 C\u00e4linescu","orcid":"https://orcid.org/0000-0002-0925-9524"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. Calinescu","raw_affiliation_strings":["Department of Computer Science, Illinois Institute of Technology, Chicago, IL, 60616","Dept. of Computer Science, Illinois Institute of Technology, Chicago,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Illinois Institute of Technology, Chicago, IL, 60616","institution_ids":["https://openalex.org/I180949307"]},{"raw_affiliation_string":"Dept. of Computer Science, Illinois Institute of Technology, Chicago,","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072751459","display_name":"Alex Zelikovsky","orcid":"https://orcid.org/0000-0003-4424-4691"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Zelikovsky","raw_affiliation_strings":["Department of Computer Science, Georgia State University, Atlanta, GA, 30303","Department of Computer Science Georgia State University Atlanta#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Georgia State University, Atlanta, GA, 30303","institution_ids":["https://openalex.org/I181565077"]},{"raw_affiliation_string":"Department of Computer Science Georgia State University Atlanta#TAB#","institution_ids":["https://openalex.org/I181565077"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030046558"],"corresponding_institution_ids":["https://openalex.org/I180949307"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.5033,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.61801868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"3","first_page":"281","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9908000230789185,"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/T12029","display_name":"DNA and Biological Computing","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9613034725189209},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7643734216690063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6827675104141235},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.637420117855072},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6286442875862122},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5292327404022217},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5239332318305969},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.516822874546051},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.49495381116867065},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4822840988636017},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47302958369255066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44177719950675964},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41679733991622925},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.41414040327072144},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3960939645767212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19770118594169617},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18777963519096375}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9613034725189209},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7643734216690063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6827675104141235},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.637420117855072},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6286442875862122},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5292327404022217},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5239332318305969},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.516822874546051},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.49495381116867065},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4822840988636017},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47302958369255066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44177719950675964},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41679733991622925},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.41414040327072144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3960939645767212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19770118594169617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18777963519096375},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-005-1412-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1412-9","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:9:y:2005:i:3:d:10.1007_s10878-005-1412-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-005-1412-9","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1484655266","https://openalex.org/W1522456302","https://openalex.org/W1561878501","https://openalex.org/W1952648253","https://openalex.org/W1970076003","https://openalex.org/W1986201860","https://openalex.org/W1990571240","https://openalex.org/W1991626387","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2018511415","https://openalex.org/W2029828838","https://openalex.org/W2041571997","https://openalex.org/W2061945091","https://openalex.org/W2082353536","https://openalex.org/W2114493937","https://openalex.org/W2145311081","https://openalex.org/W2165956524","https://openalex.org/W2295961103","https://openalex.org/W2610052675"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2376814941","https://openalex.org/W2562218965","https://openalex.org/W2138987445","https://openalex.org/W3081212354","https://openalex.org/W2943635264","https://openalex.org/W3116169590","https://openalex.org/W2055747731","https://openalex.org/W2390742649","https://openalex.org/W2350799039"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}