{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T23:07:09Z","timestamp":1761952029620,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032095435"},{"type":"electronic","value":"9783032095442"}],"license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09544-2_21","type":"book-chapter","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:23:36Z","timestamp":1761931416000},"page":"291-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Properties of\u00a0a\u00a0Class of\u00a0Greedy Algorithms for\u00a0Multicriteria Optimization"],"prefix":"10.1007","author":[{"given":"Filip","family":"Malmberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoe","family":"Dumoulin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda Andre\u00edna","family":"Francisco Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,1]]},"reference":[{"issue":"10","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1016\/j.imavis.2009.06.017","volume":"28","author":"C All\u00e8ne","year":"2010","unstructured":"All\u00e8ne, C., Audibert, J.Y., Couprie, M., Keriven, R.: Some links between extremum spanning forests, watersheds and min-cuts. Image Vis. Comput. 28(10), 1460\u20131471 (2010)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11263-006-7934-5","volume":"70","author":"Y Boykov","year":"2006","unstructured":"Boykov, Y., Funka-Lea, G.: Graph cuts and efficient nd image segmentation. Int. J. Comput. Vis. 70(2), 109\u2013131 (2006)","journal-title":"Int. J. Comput. Vis."},{"issue":"11","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1109\/TPAMI.2008.173","volume":"31","author":"J Cousty","year":"2009","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Minimum spanning forests and the drop of water principle. IEEE Trans. Pattern Anal. Mach. Intell. 31(8), 1362\u20131374 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"21_CR5","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TPAMI.2009.71","volume":"32","author":"J Cousty","year":"2009","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: thinnings, shortest path forests, and topological watersheds. IEEE Trans. Pattern Anal. Mach. Intell. 32(5), 925\u2013939 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"21_CR6","unstructured":"Ehrgott, M.: Lexicographic max-ordering-a solution concept for multicriteria combinatorial optimization (1995)"},{"key":"21_CR7","unstructured":"Ehrgott, M.: A characterization of lexicographic max-ordering solutions (1999). http:\/\/nbn-resolving.de\/urn:nbn:de:hbz:386-kluedo-4531"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Ehrgott, M.: Multicriteria Optimization, vol.\u00a0491. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-27659-9","DOI":"10.1007\/3-540-27659-9"},{"issue":"6","key":"21_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/2661229.2661258","volume":"33","author":"Z Levi","year":"2014","unstructured":"Levi, Z., Zorin, D.: Strict minimizers for geometric optimization. ACM Trans. Graph. (TOG) 33(6), 185 (2014)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s10851-020-00963-8","volume":"62","author":"F Malmberg","year":"2020","unstructured":"Malmberg, F., Ciesielski, K.C.: Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions. J. Math. Imaging Vis. 62(5), 737\u2013750 (2020)","journal-title":"J. Math. Imaging Vis."},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Malmberg, F., Ciesielski, K.C., Strand, R.: Optimization of max-norm objective functions in image processing and computer vision. In: Couprie, M., Cousty, J., Kenmochi, Y., Mustafa, N. (eds.) Discrete Geometry for Computer Imagery. DGCI 2019. LNCS, vol. 11414, p.\u00a0206. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14085-4_17","DOI":"10.1007\/978-3-030-14085-4_17"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Malmberg, F., Falc\u00e3o, A.X.: A practical algorithm for max-norm optimal binary labeling of graphs. In: Vento, M., Foggia, P., Conte, D., Carletti, V. (eds.) Graph-Based Representations in Pattern Recognition. GbRPR 2023. LNCS, vol. 14121, pp. 35\u201345. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-42795-4_4","DOI":"10.1007\/978-3-031-42795-4_4"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Malmberg, F., Strand, R., Nystr\u00f6m, I.: Generalized hard constraints for graph segmentation. In: Heyden, A., Kahl, F. (eds.) Image Analysis. SCIA 2011. LNCS, vol. 6688, pp. 36\u201347. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21227-7_4","DOI":"10.1007\/978-3-642-21227-7_4"},{"issue":"10","key":"21_CR14","doi-asserted-by":"publisher","first-page":"3724","DOI":"10.1109\/TPAMI.2020.2980827","volume":"43","author":"S Wolf","year":"2020","unstructured":"Wolf, S., et al.: The mutex watershed and its objective: efficient, parameter-free graph partitioning. IEEE Trans. Pattern Anal. Mach. Intell. 43(10), 3724\u20133738 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Wolf, S., et al.: The mutex watershed: efficient, parameter-free image partitioning. In: Ferrari, V., Hebert, M., Sminchisescu, C., Weiss, Y. (eds.) Computer Vision \u2013 ECCV 2018. ECCV 2018. LNCS, vol. 11208, pp. 546\u2013562. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01225-0_34","DOI":"10.1007\/978-3-030-01225-0_34"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry and Mathematical Morphology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09544-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T23:02:28Z","timestamp":1761951748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09544-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"ISBN":["9783032095435","9783032095442"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09544-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"assertion":[{"value":"1 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry and Mathematical Morphology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/research.rug.nl\/en\/activities\/discrete-geometry-and-mathematical-morphology-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}