{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:16:15Z","timestamp":1761174975016,"version":"build-2065373602"},"reference-count":10,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f5317","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"721-726","source":"Crossref","is-referenced-by-count":0,"title":["An algorithm for Direct Construction of all Pareto Optimal Biobjective Minimum Spanning Trees"],"prefix":"10.15439","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1833-8184","authenticated-orcid":true,"given":"Lasko","family":"Laskov","sequence":"first","affiliation":[{"name":"New Bulgarian University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9544-819X","authenticated-orcid":true,"given":"Marin","family":"Marinov","sequence":"additional","affiliation":[{"name":"New Bulgarian University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction\nto algorithms, 4th ed. Cambridge, Massachusetts: MIT Press, 2022,\nch. 21, pp. 585\u2013603. ISBN 0-262-04630-X"},{"key":"ref2","doi-asserted-by":"publisher","unstructured":"R. C. Prim, \u201cShortest connection networks and some generalizations,\u201d\nThe Bell System Technical Journal, vol. 36, no. 6, pp. 1389\u20131401, 1957.\nhttps:\/\/dx.doi.org\/10.1002\/j.1538-7305.1957.tb01515.x","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref3","doi-asserted-by":"publisher","unstructured":"M. L. Fredman and R. E. Tarjan, \u201cFibonacci heaps and their uses\nin improved network optimization algorithms,\u201d Journal of the ACM,\nvol. 34, no. 3, pp. 596\u2013615, July 1987. https:\/\/dx.doi.org\/10.1145\/28869.28874","DOI":"10.1145\/28869.28874"},{"key":"ref4","doi-asserted-by":"publisher","unstructured":"R. M. Ramos, S. Alonso, J. Sicilia, and C. Gonz\u00e1lez, \u201cThe problem of\nthe optimal biobjective spanning tree,\u201d European Journal of Operational\nResearch, vol. 111, no. 3, pp. 617\u2013628, 1998. https:\/\/dx.doi.org\/10.1016\/S0022-0000(05)80064-9","DOI":"10.1016\/S0022-0000(05)80064-9"},{"key":"ref5","doi-asserted-by":"publisher","unstructured":"D. Rocha, E. Goldbarg, and M. Goldbarg, \u201cA memetic algorithm\nfor the biobjective minimum spanning tree problem,\u201d in Evolutionary\nComputation in Combinatorial Optimization, J. Gottlieb and G. R.\nRaidl, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https:\/\/dx.doi.org\/10.1007\/11730095_19. ISBN 978-3-540-33179-7 pp. 222\u2013233.","DOI":"10.1007\/11730095_19"},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"S. Steiner and T. Radzik, \u201cComputing all efficient solutions of the biobjective minimum spanning tree problem,\u201d Computers & Operations Research, vol. 35, no. 1, pp. 198\u2013211, 2008. https:\/\/dx.doi.org\/10.1016\/j.cor.2006.02.023","DOI":"10.1016\/j.cor.2006.02.023"},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"A. C. Santos, D. R. Lima, and D. J. Aloise, \u201cModeling and solving the\nbi-objective minimum diameter-cost spanning tree problem,\u201d Journal of\nGlobal Optimization, vol. 60, pp. 195\u2013216, 2014. https:\/\/dx.doi.org\/10.1007\/s10898-013-0124-4","DOI":"10.1007\/s10898-013-0124-4"},{"key":"ref8","doi-asserted-by":"publisher","unstructured":"H. W. Corley, \u201cEfficient spanning trees,\u201d Journal of Optimization Theory\nand Applications, vol. 45, pp. 481\u2013485, 1985. https:\/\/dx.doi.org\/10.1007\/BF00938448","DOI":"10.1007\/BF00938448"},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"S. Fidanova and M. Ganzha, \u201cAnt colony optimization for workforce\nplanning with hybridization,\u201d in Proceedings of the 18th Conference\non Computer Science and Intelligence Systems, ser. Annals of\nComputer Science and Information Systems, M. Ganzha, L. Maciaszek,\nM. Paprzycki, and D. \u015al\u02dbezak, Eds., vol. 35. IEEE, 2023.\nhttps:\/\/dx.doi.org\/10.15439\/2023F9586 p. 955\u2013959.","DOI":"10.15439\/2023F9586"},{"key":"ref10","doi-asserted-by":"publisher","unstructured":"L. M. Laskov and M. L. Marinov, \u201cPareto optimal solutions of the\nbiobjective minimum length minimum risk spanning trees problem,\u201d\nin Proceedings of the of the 19th Conference on Computer Science\nand Intelligence Systems, ser. ACSIS, M. Bolanowski, M. Ganzha,\nL. Maciaszek, M. Paprzycki, and D. \u015al\u02dbezak, Eds., vol. 39. IEEE, 2024.\nhttps:\/\/doi.org\/10.15439\/2024F2913. ISSN 300-5963 pp. 405\u2013416.","DOI":"10.15439\/2024F2913"}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:51:17Z","timestamp":1761119477000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/5317.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":10,"URL":"https:\/\/doi.org\/10.15439\/2025f5317","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}