{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:56:14Z","timestamp":1743112574155,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_8","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"88-99","source":"Crossref","is-referenced-by-count":2,"title":["The Parameterized Complexity of Some Minimum Label Problems"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Iyad A.","family":"Kanj","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H. Broersma","year":"1997","unstructured":"Broersma, H., Li, X.: Spanning trees with many or few colors in edge-colored graphs. Discussiones Mathematicae Graph Theory\u00a017(2), 259\u2013269 (1997)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"8_CR2","first-page":"299","volume":"31","author":"H. Broersma","year":"2005","unstructured":"Broersma, H., Li, X., Woeginger, G., Zhang, S.: Paths and cycles in colored graphs. Australasian Journal on Combinatorics\u00a031, 299\u2013311 (2005)","journal-title":"Australasian Journal on Combinatorics"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(02)00241-9","volume":"31","author":"T. Br\u00fcggemann","year":"2003","unstructured":"Br\u00fcggemann, T., Monnot, J., Woeginger, G.: Local search for the minimum label spanning tree problem with bounded color classes. Operations Research Letters\u00a031(3), 195\u2013201 (2003)","journal-title":"Operations Research Letters"},{"key":"8_CR4","unstructured":"Carr, R., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proc. 11th ACM-SIAM SODA, pp. 345\u2013353 (2000)"},{"issue":"5","key":"8_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"R. Chang","year":"1997","unstructured":"Chang, R., Leu, S.: The minimum labeling spanning trees. IPL\u00a063(5), 277\u2013282 (1997)","journal-title":"IPL"},{"key":"8_CR6","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill Book Company, Boston (2001)","edition":"2"},{"key":"8_CR7","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)"},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10878-007-9044-x","volume":"14","author":"R. Hassin","year":"2007","unstructured":"Hassin, R., Monnot, J., Segev, D.: Approximation algorithms and hardness results for labeled connectivity problems. Journal of Combinatorial Optimization\u00a014(4), 437\u2013453 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"8_CR9","unstructured":"Jha, S., Sheyner, O., Wing, J.: Two formal analyses of attack graphs. In: Proc. 15th IEEE Computer Security Foundations Workshop, pp. 49\u201363 (2002)"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S. Krumke","year":"1998","unstructured":"Krumke, S., Wirth, H.: On the minimum label spanning tree problem. IPL\u00a066(2), 81\u201385 (1998)","journal-title":"IPL"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ipl.2005.06.009","volume":"96","author":"J. Monnot","year":"2005","unstructured":"Monnot, J.: The labeled perfect matching in bipartite graphs. IPL\u00a096(3), 81\u201388 (2005)","journal-title":"IPL"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-63890-3_11","volume-title":"Algorithms and Computation","author":"T. Uno","year":"1997","unstructured":"Uno, T.: Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 92\u2013101. Springer, Heidelberg (1997)"},{"key":"8_CR13","unstructured":"Voss, S., Cerulli, R., Fink, A., Gentili, M.: Applications of the pilot method to hard modifications of the minimum spanning tree problem. In: Proc. 18th MINI EURO Conference on VNS (2005)"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0020-0190(02)00230-2","volume":"84","author":"Y. Wan","year":"2002","unstructured":"Wan, Y., Chen, G., Xu, Y.: A note on the minimum label spanning tree. IPL\u00a084(2), 99\u2013101 (2002)","journal-title":"IPL"},{"key":"8_CR15","volume-title":"Introduction to graph theory","author":"D. West","year":"1996","unstructured":"West, D.: Introduction to graph theory. Prentice Hall Inc., Upper Saddle River (1996)"},{"key":"8_CR16","unstructured":"Wirth, H.: Multicriteria Approximation of Network Design and Network Upgrade Problems. PhD thesis, Department of Computer Science, Universit\u00e4t W\u00fcrzburg, Germany (2005)"},{"key":"8_CR17","unstructured":"Xiong, Y.: The Minimum Labeling Spanning Tree Problem and Some Variants. PhD thesis, Graduate School of the University of Maryland, USA (2005)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TEVC.2004.840145","volume":"9","author":"Y. Xiong","year":"2005","unstructured":"Xiong, Y., Golden, B., Wasil, E.: A one-parameter genetic algorithm for the minimum labeling spanning tree problem. IEEE Transactions on Evolutionary Computation\u00a09(1), 55\u201360 (2005)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.orl.2004.03.004","volume":"33","author":"Y. Xiong","year":"2005","unstructured":"Xiong, Y., Golden, B., Wasil, E.: Worst case behavior of the MVCA heuristic for the minimum labeling spanning tree problem. Operations Research Letters\u00a033(1), 77\u201380 (2005)","journal-title":"Operations Research Letters"},{"key":"8_CR20","unstructured":"Zhang, P., Tang, L., Zhao, W., Cai, J., Li, A.: Approximation and hardness results for label cut and related problems (manuscript) (2007)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T14:05:37Z","timestamp":1674741937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}