{"id":"https://openalex.org/W4415420700","doi":"https://doi.org/10.15439/2025f5317","title":"An algorithm for Direct Construction of all Pareto Optimal Biobjective Minimum Spanning Trees","display_name":"An algorithm for Direct Construction of all Pareto Optimal Biobjective Minimum Spanning Trees","publication_year":2025,"publication_date":"2025-10-15","ids":{"openalex":"https://openalex.org/W4415420700","doi":"https://doi.org/10.15439/2025f5317"},"language":"en","primary_location":{"id":"doi:10.15439/2025f5317","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2025f5317","pdf_url":"https://annals-csis.org/Volume_43/drp/pdf/5317.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/Volume_43/drp/pdf/5317.pdf","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Lasko Laskov","raw_affiliation_strings":["New Bulgarian University"],"raw_orcid":"https://orcid.org/0000-0003-1833-8184","affiliations":[{"raw_affiliation_string":"New Bulgarian University","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 Marinov","raw_affiliation_strings":["New Bulgarian University"],"raw_orcid":"https://orcid.org/0009-0003-9544-819X","affiliations":[{"raw_affiliation_string":"New Bulgarian University","institution_ids":["https://openalex.org/I122492136"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122492136"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.46266326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"43","issue":null,"first_page":"721","last_page":"726"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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.9986000061035156,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4438000023365021},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.3677999973297119},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.34599998593330383},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.33899998664855957},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.2856999933719635},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.27480000257492065}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5605000257492065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5189999938011169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47440001368522644},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4438000023365021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4212000072002411},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.3677999973297119},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.34599998593330383},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.15439/2025f5317","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2025f5317","pdf_url":"https://annals-csis.org/Volume_43/drp/pdf/5317.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:aa392625dcc34cb38acada33092d9f13","is_oa":true,"landing_page_url":"https://doaj.org/article/aa392625dcc34cb38acada33092d9f13","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 43, Pp 721-726 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.15439/2025f5317","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2025f5317","pdf_url":"https://annals-csis.org/Volume_43/drp/pdf/5317.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415420700.pdf","grobid_xml":"https://content.openalex.org/works/W4415420700.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1522801719","https://openalex.org/W2017927472","https://openalex.org/W2055424670","https://openalex.org/W2084224084","https://openalex.org/W2091360576","https://openalex.org/W2123562836","https://openalex.org/W2164485560","https://openalex.org/W4387608612","https://openalex.org/W4403673939"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,67],"describe":[4],"an":[5],"exact":[6],"algorithm":[7,80],"that":[8,56,81,101,115],"constructs":[9,25,82],"all":[10,107],"Pareto":[11,28,85,108],"optimal":[12,29,38,109],"solutions":[13,110],"of":[14,37,63,78,87,106,123],"the":[15,27,34,44,50,54,58,64,69,79,83,88,104,121],"biobjective":[16],"minimum":[17,19],"risk":[18,51],"length":[20,45],"spanning":[21,30,39],"trees":[22,31,40],"problem.The":[23],"method":[24,70],"directly":[26],"without":[32],"constructing":[33],"entire":[35],"classes":[36],"with":[41,47],"respect":[42,48],"to":[43,49,119],"and":[46,60,111],"criterion.We":[52],"formulate":[53],"theorems":[55],"prove":[57],"correctness":[59],"computational":[61,76],"complexity":[62,77],"proposed":[65],"algorithms.Also,":[66],"illustrate":[68],"using":[71],"a":[72,99,112],"comprehensive":[73],"numerical":[74],"example.The":[75],"complete":[84],"front":[86],"problem":[89],"is":[90,98],"O(s(m":[91],"+":[92],"n":[93],"lg":[94],"n)),":[95],"where":[96],"s":[97],"constant":[100,114],"depends":[102],"on":[103],"number":[105,122],"predefined":[113],"can":[116],"be":[117],"used":[118],"limit":[120],"constructed":[124],"solutions.":[125]},"counts_by_year":[],"updated_date":"2026-08-22T07:34:49.880490","created_date":"2025-10-24T00:00:00"}