{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:54Z","timestamp":1725897654423},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_47","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"525-536","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Rosenthal Potential in Multicast Games"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Nederlof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press (1997)"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S. Albers","year":"2009","unstructured":"Albers, S.: On the value of coordination in network design. SIAM J. Comput.\u00a038, 2273\u20132302 (2009)","journal-title":"SIAM J. Comput."},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput.\u00a038, 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. Theory of Computing\u00a04, 77\u2013109 (2008)","journal-title":"Theory of Computing"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/JSAC.2007.070813","volume":"25","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. IEEE Journal on Selected Areas in Communications\u00a025, 1193\u20131206 (2007)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H.-L. Chen","year":"2010","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput.\u00a039, 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"key":"47_CR7","doi-asserted-by":"publisher","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. Springer, New York (1999)"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. In: Proceedings 8th ACM Conference on Electronic Commerce (EC 2007), pp. 84\u201392. ACM (2007)","DOI":"10.1145\/1250910.1250924"},{"key":"47_CR10","unstructured":"Fellows, M., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Villanger, Y.: Local search: Is brute-force avoidable? In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 486\u2013491. AAAI (2009)"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci.\u00a0410, 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"47_CR12","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1236457.1236458","volume":"54","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Kumar, A., P\u00e1l, M., Roughgarden, T.: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM\u00a054, 11 (2007)","journal-title":"J. ACM"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s00453-007-9065-y","volume":"50","author":"A. Gupta","year":"2008","unstructured":"Gupta, A., Srinivasan, A., Tardos, \u00c9.: Cost-sharing mechanisms for network design. Algorithmica\u00a050, 98\u2013119 (2008)","journal-title":"Algorithmica"},{"key":"47_CR15","volume-title":"Algorithm design","author":"J. Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm design. Addison-Wesley, Boston (2005)"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. Computer Science Review\u00a03, 65\u201369 (2009)","journal-title":"Computer Science Review"},{"key":"47_CR17","first-page":"7","volume":"3","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Local search. Parameterized Complexity Newsletter\u00a03, 7\u20138 (2008)","journal-title":"Parameterized Complexity Newsletter"},{"key":"47_CR18","unstructured":"Michiels, W., Aarts, E.H.L., Korst, J.: Theoretical Aspects of Local Search. Springer (2007)"},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"47_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"key":"47_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: Quantifying inefficiency in cost-sharing mechanisms. J. ACM\u00a056 (2009)","DOI":"10.1145\/1538902.1538907"},{"key":"47_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM\u00a049, 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"47_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.disopt.2010.07.003","volume":"8","author":"S. Szeider","year":"2011","unstructured":"Szeider, S.: The parameterized complexity of k-flip local search for sat and max sat. Discrete Optimization\u00a08, 139\u2013145 (2011)","journal-title":"Discrete Optimization"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:13:43Z","timestamp":1620130423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}