{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:31Z","timestamp":1725514411716},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_32","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"354-361","source":"Crossref","is-referenced-by-count":1,"title":["Feedback Arc Set Problem in Bipartite Tournaments"],"prefix":"10.1007","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating Inconsistent Information: Ranking and Clustering. In: Proceedings of 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 684\u2013693 (2005)","key":"32_CR1","DOI":"10.1145\/1060590.1060692"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking Tournaments. Siam Journal on Discrete Mathematics\u00a020(1), 137\u2013142 (2006)","journal-title":"Siam Journal on Discrete Mathematics"},{"unstructured":"Charbit, P., Thomass\u00e9, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for Tournaments. To appear in Combinatorics, Probability and Computing.","key":"32_CR3"},{"unstructured":"V. Contizer. Computing Slater rankings using similarities among candidates. Technical Report RC23748, IBM Thomas J. Watson Research Centre, NY (2005)","key":"32_CR4"},{"doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Fleischer, L., Rudra, A.: Ordering by weighted number of wins gives a good ranking for weighted tournaments. In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 776\u2013782 (2006)","key":"32_CR5","DOI":"10.1145\/1109557.1109642"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., et al.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020, 151\u2013174 (1998)","journal-title":"Algorithmica"},{"unstructured":"Guo, J., H\u00fcffner, F., Moser, H.: Feedback Arc Set in Bipartite tournaments is NP-Complete. To appear in Information Processing Letters (IPL)","key":"32_CR7"},{"issue":"6","key":"32_CR8","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of ACM\u00a046(6), 787\u2013832 (1999)","journal-title":"Journal of ACM"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P.D. Seymour","year":"1995","unstructured":"Seymour, P.D.: Packing directed circuits fractionally. Combinatorica\u00a015, 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-52292-1_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Speckenmeyer","year":"1990","unstructured":"Speckenmeyer, E.: On Feedback Problems in Digraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 218\u2013231. Springer, Heidelberg (1990)"},{"unstructured":"van Zuylen, A.: Deterministic approximation algorithm for clustering problems. Technical Report 1431, School of Operation Research and Industrial Engineering, Cornell University.","key":"32_CR11"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:11Z","timestamp":1619516291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_32","relation":{},"subject":[]}}