{"id":"https://openalex.org/W1930167353","doi":"https://doi.org/10.1007/3-540-61310-2_9","title":"A network-flow technique for finding low-weight bounded-degree spanning trees","display_name":"A network-flow technique for finding low-weight bounded-degree spanning trees","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1930167353","doi":"https://doi.org/10.1007/3-540-61310-2_9","mag":"1930167353"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61310-2_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61310-2_9","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":"conference-paper","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/A5015542807","display_name":"S\u00e1ndor P. Fekete","orcid":"https://orcid.org/0000-0002-9062-4241"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S\u00e1ndor P. Fekete","raw_affiliation_strings":["Center for Parallel Computing, Universit\u00e4t zu K\u00f6ln, D-50923, K\u00f6ln, Germany",", Universit\u00e4t zu K\u00f6ln,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Parallel Computing, Universit\u00e4t zu K\u00f6ln, D-50923, K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":", Universit\u00e4t zu K\u00f6ln,","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"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":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD","University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052752494","display_name":"Monika Klemmstein","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Monika Klemmstein","raw_affiliation_strings":["Center for Parallel Computing, Universit\u00e4t zu K\u00f6ln, D-50923, K\u00f6ln, Germany",", Universit\u00e4t zu K\u00f6ln,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Parallel Computing, Universit\u00e4t zu K\u00f6ln, D-50923, K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":", Universit\u00e4t zu K\u00f6ln,","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Box 830688, 75083-0688, Richardson, TX","The University of Texas at Dallas;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Box 830688, 75083-0688, Richardson, TX","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"The University of Texas at Dallas;","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006234305","display_name":"Neal E. Young","orcid":"https://orcid.org/0000-0001-8144-3345"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]},{"id":"https://openalex.org/I4210166639","display_name":"Dartmouth Hospital","ror":"https://ror.org/02j3qj605","country_code":"GB","type":"healthcare","lineage":["https://openalex.org/I4210166639"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Neal Young","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, 03755-3510, Hanover, NH","Dartmouth College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, 03755-3510, Hanover, NH","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Dartmouth College","institution_ids":["https://openalex.org/I107672454","https://openalex.org/I4210166639"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.13384723,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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/T11106","display_name":"Data Management and Algorithms","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/degree","display_name":"Degree (music)","score":0.7097363471984863},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.691429615020752},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6675261855125427},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6248085498809814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6077654361724854},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5863385200500488},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5777894258499146},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48056653141975403},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47872161865234375},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.47447139024734497},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4509980380535126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38510453701019287}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7097363471984863},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.691429615020752},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6675261855125427},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6248085498809814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6077654361724854},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5863385200500488},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5777894258499146},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48056653141975403},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47872161865234375},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.47447139024734497},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4509980380535126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38510453701019287},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/3-540-61310-2_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61310-2_9","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:e-archive.informatik.uni-koeln.de:208","is_oa":false,"landing_page_url":"http://e-archive.informatik.uni-koeln.de/208/1/zpr95-208.ps","pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.3311","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.zpr.uni-koeln.de/pub/paper/postscript/zpr95-208.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.7011","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.7011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.mi.uni-koeln.de/pub/paper/zpr95-208.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.4806","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.4806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucr.edu/~neal/non_arxiv/algorithms_1997_24_310.pdf","raw_type":"text"},{"id":"pmh:oai:drum.lib.umd.edu:1903/762","is_oa":false,"landing_page_url":"http://hdl.handle.net/1903/762","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Technical Report"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:208001","is_oa":false,"landing_page_url":"http://e-archive.informatik.uni-koeln.de/208001/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt3fv637gx","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/3fv637gx","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt4kx627pp","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/4kx627pp","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Algorithms, vol 24, iss 2","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":27,"referenced_works":["https://openalex.org/W1541536235","https://openalex.org/W1550550959","https://openalex.org/W1601487505","https://openalex.org/W1971782520","https://openalex.org/W1973264741","https://openalex.org/W1977545325","https://openalex.org/W1995670816","https://openalex.org/W2002764437","https://openalex.org/W2011039300","https://openalex.org/W2017127755","https://openalex.org/W2022563199","https://openalex.org/W2023457294","https://openalex.org/W2033250446","https://openalex.org/W2033983963","https://openalex.org/W2036940456","https://openalex.org/W2053998903","https://openalex.org/W2054611719","https://openalex.org/W2056839231","https://openalex.org/W2066700938","https://openalex.org/W2088839217","https://openalex.org/W2402320104","https://openalex.org/W2951475756","https://openalex.org/W3099328339","https://openalex.org/W4285719527","https://openalex.org/W4291439952","https://openalex.org/W6632431736","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2099915933","https://openalex.org/W4224251989","https://openalex.org/W1991421283","https://openalex.org/W2951475756","https://openalex.org/W4220861011","https://openalex.org/W2387385213","https://openalex.org/W2418231958","https://openalex.org/W2071845176"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}