{"id":"https://openalex.org/W1570066579","doi":"https://doi.org/10.1007/978-3-540-74456-6_10","title":"Approximation Algorithms for the Maximum Internal Spanning Tree Problem","display_name":"Approximation Algorithms for the Maximum Internal Spanning Tree Problem","publication_year":2007,"publication_date":"2007-08-14","ids":{"openalex":"https://openalex.org/W1570066579","doi":"https://doi.org/10.1007/978-3-540-74456-6_10","mag":"1570066579"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74456-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_10","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/A5040446647","display_name":"G\u00e1bor Salamon","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"G\u00e1bor Salamon","raw_affiliation_strings":["Department of Computer Science and Information Theory, Budapest University of Technology and Economics, 1117 Budapest, Magyar tud\u00f3sok k\u00f6r\u00fatja 2, Hungary","Dept. of Computer Science and Information Theory, Budapest University of Technology and Economics, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Theory, Budapest University of Technology and Economics, 1117 Budapest, Magyar tud\u00f3sok k\u00f6r\u00fatja 2, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Dept. of Computer Science and Information Theory, Budapest University of Technology and Economics, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040446647"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":10.6549,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.98561381,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"90","last_page":"102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9812999963760376,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7094873785972595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6199074983596802},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5697268843650818},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5646986961364746},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5609825253486633},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5543065071105957},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5518423914909363},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5093982815742493},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4352799654006958},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4052669107913971},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3382493853569031},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.23690825700759888},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.21022984385490417},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10854166746139526},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0731770396232605}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7094873785972595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6199074983596802},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5697268843650818},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5646986961364746},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5609825253486633},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5543065071105957},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5518423914909363},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5093982815742493},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4352799654006958},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4052669107913971},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3382493853569031},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.23690825700759888},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21022984385490417},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10854166746139526},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0731770396232605}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-74456-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_10","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":5,"referenced_works":["https://openalex.org/W266979934","https://openalex.org/W1543611576","https://openalex.org/W1728611673","https://openalex.org/W2093816675","https://openalex.org/W2403006989"],"related_works":["https://openalex.org/W1980288485","https://openalex.org/W3016811403","https://openalex.org/W1985149601","https://openalex.org/W1965702747","https://openalex.org/W1964611452","https://openalex.org/W2130375301","https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W2400989246","https://openalex.org/W4308416203"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}