{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:15:26Z","timestamp":1743102926797,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034282"},{"type":"electronic","value":"9783642034299"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03429-9_5","type":"book-chapter","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T08:12:52Z","timestamp":1251447172000},"page":"56-70","source":"Crossref","is-referenced-by-count":1,"title":["C-semiring Frameworks for Minimum Spanning Tree Problems"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Bistarelli","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Santini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Introduction to algorithms","author":"T.T. Cormen","year":"1990","unstructured":"Cormen, T.T., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"07","author":"R. Graham","year":"1985","unstructured":"Graham, R., Hell, P.: On the history of the minimum spanning tree problem. IEEE Annals of the History of Computing\u00a007(1), 43\u201357 (1985)","journal-title":"IEEE Annals of the History of Computing"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/65.819168","volume":"14","author":"B. Wang","year":"2000","unstructured":"Wang, B., Hou, J.: Multicast routing and its QoS extension: problems, algorithms, and protocols. IEEE Network\u00a014, 22\u201336 (2000)","journal-title":"IEEE Network"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b95712","volume-title":"Semirings for Soft Constraint Solving and Programming","author":"S. Bistarelli","year":"2004","unstructured":"Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol.\u00a02962. Springer, London (2004)"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"S. Bistarelli","year":"1997","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM\u00a044(2), 201\u2013236 (1997)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR6","first-page":"321","volume":"7","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. J. Autom. Lang. Comb.\u00a07(3), 321\u2013350 (2002)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.entcs.2007.07.008","volume":"190","author":"S. Bistarelli","year":"2007","unstructured":"Bistarelli, S., Montanari, U., Rossi, F., Santini, F.: Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming. Electr. Notes Theor. Comput. Sci.\u00a0190(3), 111\u2013127 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"5_CR8","first-page":"162","volume-title":"ICN","author":"S. Bistarelli","year":"2008","unstructured":"Bistarelli, S., Santini, F.: A formal and practical framework for constraint-based routing. In: ICN, pp. 162\u2013167. IEEE Computer Society, Los Alamitos (2008)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","volume":"114","author":"G. Zhou","year":"1999","unstructured":"Zhou, G., Gen, M.: Genetic algorithm approach on multi-criteria minimum spanning tree problem. European Journal of Operational Research\u00a0114, 141\u2013152 (1999)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0377-2217(01)00346-0","volume":"143","author":"J.D. Knowles","year":"2002","unstructured":"Knowles, J.D., Corne, D.W.: Enumeration of pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen\u2019s proposed algorithm. European Journal of Operational Research\u00a0143(3), 543\u2013547 (2002)","journal-title":"European Journal of Operational Research"},{"key":"5_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, automata, languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, automata, languages. Springer, London (1986)"},{"key":"5_CR12","first-page":"63","volume-title":"ECAI","author":"S. Bistarelli","year":"2006","unstructured":"Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI, pp. 63\u201367. IOS Press, Amsterdam (2006)"},{"key":"5_CR13","volume-title":"Algorithm Design","author":"J. Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley Longman Publishing Co. Inc, Boston (2005)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0097-3165(95)90022-5","volume":"71","author":"P.W. Shor","year":"1995","unstructured":"Shor, P.W.: A new proof of Cayley\u2019s formula for counting labeled trees. J. Comb. Theory Ser. A\u00a071(1), 154\u2013158 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1013609600697","volume":"8","author":"S. Bistarelli","year":"2002","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Soft constraint logic programming and generalized shortest path problems. Journal of Heuristics\u00a08(1), 25\u201341 (2002)","journal-title":"Journal of Heuristics"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03429-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:25:32Z","timestamp":1558268732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03429-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034282","9783642034299"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03429-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}