Skip to main content
SpringerLink
Log in

A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments

  • Conference paper
Mathematical Foundations of Computer Science 2012 (MFCS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7464))

  • 1430 Accesses

Abstract

The k-feedback arc set problem is to determine whether there is a set F of at most k arcs in a directed graph G such that the removal of F makes G acyclic. The k-feedback arc set problems in tournaments and bipartite tournaments (k-FAST and k-FASBT) have applications in ranking aggregation and have been extensively studied from the viewpoint of parameterized complexity. Recently, Misra et al. provide a problem kernel with O(k 3) vertices for k-FASBT. Answering an open question by Misra et al., we improve the kernel bound to O(k 2) vertices by introducing a new concept called “bimodule.”

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. Journal of Computer and System Sciences 76(7), 524–531 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alon, N.: Ranking tournaments. SIAM J. Discrete Math. 20(1), 137–142 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 49–58. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Cai, M., Deng, M., Zang, W.: A min-max theorem on feedback vertex sets. Math. Oper. Res. 27(2), 361–371 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bessy, S., Fomin, F.V., Gaspers, S., Paul, C., Perez, A., Saurabh, S., Thomassé, S.: Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6), 1071–1078 (2009)

    Article  Google Scholar 

  6. Charbit, P., Thomassé, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Combin. Probab. Comput. 16(1), 1–4 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dom, M., Guo, J., Hüffner, F., Niedermeier, R., Truß, A.: Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1), 76–86 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Guo, J., Hüffner, F., Moser, H.: Feedback arc set in bipartite tournaments is NP-complete. Inf. Process. Lett. 102(2-3), 62–65 (2007)

    Article  MATH  Google Scholar 

  9. Hsiao, S.-Y.: Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 344–353. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Karpinski, M., Schudy, W.: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol. 6506, pp. 3–14. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Kemeny, J.: Mathematics without numbers. Daedalus 88, 571–591 (1959)

    Google Scholar 

  12. Kemeny, J., Snell, J.: Mathematical models in the social sciences. Blaisdell (1962)

    Google Scholar 

  13. Hsiao, S.-Y.: Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 344–353. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Paul, C., Perez, A., Thomassé, S.: Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 497–507. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Sanghvi, B., Koul, N., Honavar, V.: Identifying and Eliminating Inconsistencies in Mappings across Hierarchical Ontologies. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6427, pp. 999–1008. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Speckenmeyer, E.: On Feedback Problems in Digraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 218–231. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  17. Sasatte, P.: Improved FPT algorithm for feedback vertex set problem in bipartite tournament. Information Processing Letters 105(3), 79–82 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wahlström, M.: Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems. PhD thesis, Linköpings universitet (2007)

    Google Scholar 

  19. Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351(3), 446–458 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

    Mingyu Xiao

  2. Universität des Saarlandes, Campus E 1.7, D-66123, Saarbrücken, Germany

    Jiong Guo

Authors
  1. Mingyu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynska Dolina, 84248, Bratislava, Slovakia

    Branislav Rovan

  2. Department of Electronics and Computer Science, University of Southampton, SO17 1BJ, Southampton, UK

    Vladimiro Sassone

  3. Institute of Theoretical Computer Science, ETH Zürich, CAB H 39.2, Universitätstrasse 6, 8092, Zürich, Switzerland

    Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, M., Guo, J. (2012). A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32589-2_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32588-5

  • Online ISBN: 978-3-642-32589-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation