{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:35:16Z","timestamp":1761896116788,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_20","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"322-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems"],"prefix":"10.1007","author":[{"given":"Nawal","family":"Benabbou","sequence":"first","affiliation":[]},{"given":"Patrice","family":"Perny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"20_CR1","unstructured":"Benabbou, N., Perny, P.: Combining preference elicitation and search in multiobjective state-space graphs. In: Proceedings of IJCAI 2015 (2015)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Perny, P.: Incremental weight elicitation for multiobjective state space search. In: Proceedings of AAAI 2015, pp. 1093\u20131099 (2015)","DOI":"10.1609\/aaai.v29i1.9362"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Perny, P., Viappiani, P.: Incremental elicitation of choquet capacities for multicriteria decision making. In: Proceedings of ECAI 2014, pp. 87\u201392 (2014)","DOI":"10.3233\/978-1-61499-419-0-87"},{"issue":"8\u20139","key":"20_CR4","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.artint.2006.02.003","volume":"170","author":"C Boutilier","year":"2006","unstructured":"Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170(8\u20139), 686\u2013713 (2006)","journal-title":"Artif. Intell."},{"key":"20_CR5","unstructured":"Braziunas, D., Boutilier, C.: Minimax regret based elicitation of generalized additive utilities. In: Proceedings of UAI 2007, pp. 25\u201332 (2007)"},{"key":"20_CR6","unstructured":"Braziunas, D.: Decision-theoretic elicitation of generalized additive utilities. Ph.D. thesis, University of Toronto (2011)"},{"key":"20_CR7","first-page":"376","volume":"23","author":"A Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Q. J. Math. 23, 376\u2013378 (1889)","journal-title":"Q. J. Math."},{"key":"20_CR8","unstructured":"Chajewska, U., Koller, D., Parr, R.: Making rational decisions using adaptive utility elicitation. In: Proceedings of AAAI 2000, pp. 363\u2013369 (2000)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Drummond, J., Boutilier, C.: Preference elicitation and interview minimization in stable matchings. In: Proceedings of AAAI 2014, pp. 645\u2013653 (2014)","DOI":"10.1609\/aaai.v28i1.8829"},{"key":"20_CR10","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2006","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2006)"},{"issue":"3\u20134","key":"20_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.artint.2009.11.015","volume":"174","author":"M Gelain","year":"2010","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies. Artif. Intell. J. 174(3\u20134), 270\u2013294 (2010)","journal-title":"Artif. Intell. J."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02032304","volume":"52","author":"HW Hamacher","year":"1994","unstructured":"Hamacher, H.W., Ruhe, G.: On spanning tree problems with multiple objectives. Ann. Oper. Res. 52, 209\u2013230 (1994)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10458-010-9133-6","volume":"22","author":"M Kalech","year":"2010","unstructured":"Kalech, M., Kraus, S., Kaminka, G.A.: Practical voting rules with partial information. Auton. Agent. Multi-Agent Syst. 22(1), 151\u2013182 (2010)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"20_CR15","unstructured":"Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. In: Proceedings of IJCAI 2011, pp. 287\u2013293 (2011)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.ins.2014.03.065","volume":"278","author":"L Naamani-Dery","year":"2014","unstructured":"Naamani-Dery, L., Kalech, M., Rokach, L., Shapira, B.: Reaching a joint decision with minimal elicitation of voter preferences. Inf. Sci. 278, 466\u2013487 (2014)","journal-title":"Inf. Sci."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSMC.1984.6313205","volume":"14","author":"CC White III","year":"1984","unstructured":"White III, C.C., Sage, A.P., Dozono, S.: A model of multiattribute decisionmaking and trade-off weight determination under uncertainty. IEEE Trans. Syst. Man Cybern. 14(2), 223\u2013229 (1984)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"20_CR19","unstructured":"Regan, K., Boutilier, C.: Eliciting additive reward functions for markov decision processes. In: Proceedings of IJCAI 2011, pp. 2159\u20132164 (2011)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-02094-0_6","volume-title":"Algorithmics of Large and Complex Networks","author":"S Ruzika","year":"2009","unstructured":"Ruzika, S., Hamacher, H.W.: A survey on multiple objective minimum spanning tree problems. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks, pp. 104\u2013116. Springer, Heidelberg (2009)"},{"key":"20_CR21","unstructured":"Seipp, F.: On adjacency, cardinality, and partial dominance in discrete multiple objective optimization. Ph.D. thesis, Technischen Universitat Kaiserslautern (2013)"},{"issue":"3","key":"20_CR22","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F Sourd","year":"2008","unstructured":"Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J. Comput. 20(3), 472\u2013484 (2008)","journal-title":"INFORMS J. Comput."},{"key":"20_CR23","unstructured":"Wang, T., Boutilier, C.: Incremental utility elicitation with the minimax regret decision criterion. In: Proceedings of IJCAI 2003, pp. 309\u2013316 (2003)"},{"key":"20_CR24","unstructured":"Weng, P., Zanuttini, B.: Interactive value iteration for Markov decision processes with unknown rewards. In: Proceedings of IJCAI 2013, pp. 2415\u20132421 (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:34:13Z","timestamp":1748583253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}