{"id":"https://openalex.org/W1567663444","doi":"https://doi.org/10.1007/3-540-61422-2_128","title":"Using sparsification for parametric minimum spanning tree problems","display_name":"Using sparsification for parametric minimum spanning tree problems","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1567663444","doi":"https://doi.org/10.1007/3-540-61422-2_128","mag":"1567663444"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61422-2_128","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_128","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/A5070873690","display_name":"David Fern\u00e1ndez\u2010Baca","orcid":"https://orcid.org/0000-0002-8563-3637"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Fern\u00e1ndez-Baca","raw_affiliation_strings":["Department of Computer Science, Iowa State University, 50011, Ames, IA","Iowa State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, 50011, Ames, IA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044866430","display_name":"Giora Slutzki","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Giora Slutzki","raw_affiliation_strings":["Department of Computer Science, Iowa State University, 50011, Ames, IA","Iowa State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, 50011, Ames, IA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108527295","display_name":"David Eppstein","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]},{"id":"https://openalex.org/I2803209242","display_name":"University of California System","ror":"https://ror.org/00pjdza24","country_code":"US","type":"education","lineage":["https://openalex.org/I2803209242"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Eppstein","raw_affiliation_strings":["Department of Information and Computer Science, University of California, 92717, Irvine, CA","University of California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Science, University of California, 92717, Irvine, CA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"University of California","institution_ids":["https://openalex.org/I2803209242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8197,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.68675543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"149","last_page":"160"},"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.9995999932289124,"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.9995999932289124,"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.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/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8931594491004944},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8885563015937805},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6128103137016296},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6105239987373352},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5702999830245972},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5522963404655457},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.5059697031974792},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4998641014099121},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4938703179359436},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46655410528182983},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4630565345287323},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.436997652053833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40952008962631226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2928207814693451},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.286379873752594},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23683428764343262},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17545971274375916},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.13799110054969788},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06540986895561218},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.061514317989349365}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8931594491004944},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8885563015937805},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6128103137016296},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6105239987373352},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5702999830245972},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5522963404655457},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5059697031974792},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4998641014099121},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4938703179359436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46655410528182983},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4630565345287323},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.436997652053833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40952008962631226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2928207814693451},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.286379873752594},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23683428764343262},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17545971274375916},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.13799110054969788},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06540986895561218},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.061514317989349365},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-61422-2_128","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61422-2_128","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1515275965","https://openalex.org/W1576317141","https://openalex.org/W1587940564","https://openalex.org/W1588830601","https://openalex.org/W1971057413","https://openalex.org/W1982512167","https://openalex.org/W1985783557","https://openalex.org/W2011565421","https://openalex.org/W2011824743","https://openalex.org/W2013382394","https://openalex.org/W2015696135","https://openalex.org/W2018804864","https://openalex.org/W2023256083","https://openalex.org/W2027029507","https://openalex.org/W2032543303","https://openalex.org/W2048285065","https://openalex.org/W2049596277","https://openalex.org/W2067650944","https://openalex.org/W2068707503","https://openalex.org/W2095060915","https://openalex.org/W2097004206","https://openalex.org/W2097890715","https://openalex.org/W2108928028","https://openalex.org/W2121473031","https://openalex.org/W2127605247","https://openalex.org/W2138304862","https://openalex.org/W2151025705","https://openalex.org/W2164485560","https://openalex.org/W2210521902","https://openalex.org/W2690212491","https://openalex.org/W2752885492","https://openalex.org/W4247568091","https://openalex.org/W4247674447","https://openalex.org/W6656293147","https://openalex.org/W7029321148","https://openalex.org/W7038495380"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W2390742649","https://openalex.org/W2589768050","https://openalex.org/W2381121915","https://openalex.org/W2138987445","https://openalex.org/W2387385213","https://openalex.org/W2353025557","https://openalex.org/W2281826919"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}