{"id":"https://openalex.org/W7168097848","doi":"https://doi.org/10.1007/978-3-032-22221-3_26","title":"Polynomial Algorithm for\u00a0Minimal Complete Pareto Front of\u00a0a\u00a0Biobjective Minimum Spanning Trees Problem","display_name":"Polynomial Algorithm for\u00a0Minimal Complete Pareto Front of\u00a0a\u00a0Biobjective Minimum Spanning Trees Problem","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168097848","doi":"https://doi.org/10.1007/978-3-032-22221-3_26"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-22221-3_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-22221-3_26","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/A5054967641","display_name":"\u041b\u0430\u0441\u043a\u043e \u041b\u0430\u0441\u043a\u043e\u0432","orcid":"https://orcid.org/0000-0003-1833-8184"},"institutions":[{"id":"https://openalex.org/I122492136","display_name":"New Bulgarian University","ror":"https://ror.org/002qhr126","country_code":"BG","type":"education","lineage":["https://openalex.org/I122492136"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Lasko M. Laskov","raw_affiliation_strings":["Informatics Department, New Bulgarian University, Sofia, Bulgaria"],"raw_orcid":"https://orcid.org/0000-0003-1833-8184","affiliations":[{"raw_affiliation_string":"Informatics Department, New Bulgarian University, Sofia, Bulgaria","institution_ids":["https://openalex.org/I122492136"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039856906","display_name":"Marin Marinov","orcid":"https://orcid.org/0009-0003-9544-819X"},"institutions":[{"id":"https://openalex.org/I122492136","display_name":"New Bulgarian University","ror":"https://ror.org/002qhr126","country_code":"BG","type":"education","lineage":["https://openalex.org/I122492136"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Marin L. Marinov","raw_affiliation_strings":["Informatics Department, New Bulgarian University, Sofia, Bulgaria"],"raw_orcid":"https://orcid.org/0009-0003-9544-819X","affiliations":[{"raw_affiliation_string":"Informatics Department, New Bulgarian University, Sofia, Bulgaria","institution_ids":["https://openalex.org/I122492136"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054967641"],"corresponding_institution_ids":["https://openalex.org/I122492136"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"237","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7483000159263611,"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.7483000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03539999946951866,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.031599998474121094,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.4449000060558319},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4388999938964844},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4138999879360199},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3971000015735626},{"id":"https://openalex.org/keywords/front","display_name":"Front (military)","score":0.3910999894142151},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.38839998841285706},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.35850000381469727}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7095999717712402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5426999926567078},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4627000093460083},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4449000060558319},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4388999938964844},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4138999879360199},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3971000015735626},{"id":"https://openalex.org/C2777551076","wikidata":"https://www.wikidata.org/wiki/Q842332","display_name":"Front (military)","level":2,"score":0.3910999894142151},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38839998841285706},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.34779998660087585},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.288100004196167},{"id":"https://openalex.org/C53016008","wikidata":"https://www.wikidata.org/wiki/Q620167","display_name":"Front and back ends","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.2777999937534332},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.2508000135421753},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-22221-3_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-22221-3_26","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":13,"referenced_works":["https://openalex.org/W1483353037","https://openalex.org/W1965680834","https://openalex.org/W2017927472","https://openalex.org/W2027592267","https://openalex.org/W2055424670","https://openalex.org/W2071346873","https://openalex.org/W2084224084","https://openalex.org/W2087216833","https://openalex.org/W2091360576","https://openalex.org/W2123562836","https://openalex.org/W2169528473","https://openalex.org/W4210881681","https://openalex.org/W4243588724"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-07-13T00:00:00"}