{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:55:49Z","timestamp":1649192149918},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T00:00:00Z","timestamp":1410825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00224-014-9573-5","type":"journal-article","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T02:19:03Z","timestamp":1410747543000},"page":"81-96","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Rosenthal Potential in Multicast Games"],"prefix":"10.1007","volume":"57","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","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","published-online":{"date-parts":[[2014,9,16]]},"reference":[{"key":"9573_CR1","unstructured":"Aarts, E.H.L., Lenstra, J.K: Local Search in Combinatorial Optimization. Princeton University Press (1997)"},{"key":"9573_CR2","doi-asserted-by":"crossref","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. 38, 2273\u20132302 (2009)","journal-title":"SIAM J. Comput."},{"key":"9573_CR3","doi-asserted-by":"crossref","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. 38, 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"9573_CR4","doi-asserted-by":"crossref","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 Comput. 4, 77\u2013109 (2008)","journal-title":"Theory Comput."},{"key":"9573_CR5","doi-asserted-by":"crossref","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 J. Sel. Areas Commun. 25, 1193\u20131206 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9573_CR6","doi-asserted-by":"crossref","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. 39, 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"key":"9573_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, Texts in Computer Science (2013)"},{"key":"9573_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1972","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"9573_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). ACM, 84\u201392 (2007)","DOI":"10.1145\/1250910.1250924"},{"key":"9573_CR10","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.jcss.2011.10.003","volume":"78","author":"MR Fellows","year":"2012","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F.A., Saurabh, S., Villanger, Y.: Local search: Is brute-force avoidable?. J. Comput. Syst. Sci. 78, 707\u2013719 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"9573_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR 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. 410, 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9573_CR12","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer-Verlag, Berlin (2006)"},{"key":"9573_CR13","doi-asserted-by":"crossref","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 54, 11 (2007)","journal-title":"J. ACM"},{"key":"9573_CR14","doi-asserted-by":"crossref","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 50, 98\u2013119 (2008)","journal-title":"Algorithmica"},{"key":"9573_CR15","volume-title":"Inequalities","author":"GH Hardy","year":"1934","unstructured":"Hardy, G.H., Polya, G., Littlewood, J.E.: Inequalities. The University press, Cambridge [Eng.] (1934)"},{"key":"9573_CR16","volume-title":"Algorithm design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm design. Addison-Wesley, Boston (2005)"},{"key":"9573_CR17","doi-asserted-by":"crossref","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. Comput. Sci. Rev. 3, 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"9573_CR18","first-page":"7","volume":"3","author":"D Marx","year":"2008","unstructured":"Marx, D.: Local search. Parameterized Complexity Newsl. 3, 7\u20138 (2008)","journal-title":"Parameterized Complexity Newsl."},{"key":"9573_CR19","unstructured":"Michiels, W., Aarts, E.H.L., Korst, J.: Theoretical Aspects of Local Search. Springer-Verlag (2007)"},{"key":"9573_CR20","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":"9573_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9573_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: Quantifying inefficiency in cost-sharing mechanisms. J. ACM, 56 (2009)","DOI":"10.1145\/1538902.1538907"},{"key":"9573_CR23","doi-asserted-by":"crossref","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 49, 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"9573_CR24","doi-asserted-by":"crossref","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. Discret. Optim. 8, 139\u2013145 (2011)","journal-title":"Discret. Optim."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9573-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9573-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9573-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:27Z","timestamp":1558698867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9573-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,16]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9573"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9573-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,16]]}}}