Skip to main content
SpringerLink
Log in

Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems

  • Conference paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX 2011, RANDOM 2011)

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

Abstract

We settle the approximability status of the Minimum Betweenness problem in tournaments by designing a polynomial time approximation scheme (PTAS). No constant factor approximation was previously known. We also introduce a more general class of so-called fragile ranking problems and construct PTASs for them. The results depend on a new technique of dealing with fragile ranking constraints and could be of independent interest.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ailon, N.: Aggregation of Partial Rankings, p-ratings and top-m Lists. In: 18th SODA, pp. 415–424 (2007)

    Google Scholar 

  2. Ailon, N., Alon, N.: Hardness of Fully Dense Problems. Inf. Comput. 205, 1117–1129 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ailon, N., Charikar, M., Newman, A.: Aggregating Inconsistent Information: Ranking and Clustering. J. ACM 55 (2008)

    Google Scholar 

  4. Alon, N., Fernandez de la Vega, W., Kannan, R., Karpinski, M.: Random Sampling and Approximation of MAX-CSP Problems. In: 34th ACM STOC, pp. 232–239 (2002); Journal version in JCSS 67, 212–243 (2003)

    Google Scholar 

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

    Chapter  Google Scholar 

  6. Arora, S., Karger, D., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. In: 27th ACM STOC, pp. 284–293 (1995); Journal version in J. Comput. System Sciences 58, 193–210 (1999)

    Google Scholar 

  7. Bazgan, C., Fernandez de la Vega, W., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of the Minimum Constraint Satisfaction Problem. Random Structures and Algorithms 23, 73–91 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Charikar, M., Guruswami, V., Manokaran, R.: Every Permutation CSP of Arity 3 is Approximation Restitant. In: 24th IEEE CCC (2009)

    Google Scholar 

  9. Chor, B., Sudan, M.: A Geometric Approach to Betweenness. SIAM J. Discrete Math. 11, 511–523 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fernandez de la Vega, W., Kannan, R., Karpinski, M.: Approximation of Global MAX–CSP Problems. Technical Report TR06-124, ECCC (2006)

    Google Scholar 

  11. Frieze, A., Kannan, R.: Quick Approximation to Matrices and Applications. Combinatorica 19, 175–220 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Guruswami, V., Hastad, J., Manokaran, R., Raghavendra, P., Charikar, M.: Beating the random ordering is hard: Every ordering csp is approximation resistant. In: ECCC TR-11-027 (2011)

    Google Scholar 

  13. Gutin, G., Kim, E.J., Mnich, M., Yeo, A.: Betweenness parameterized above tight lower bound. Journal of Computer and System Sciences 76(8), 872–878 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Karpinski, M., Schudy, W.: Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems. In: 41st ACM STOC, pp. 313–322 (2009)

    Google Scholar 

  15. Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set tournament, kemeny rank aggregation and betweenness tournament (LNCS 6506/2010). In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 3–14. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Mathieu, C., Schudy, W.: How to Rank with Few Errors. In: 39th ACM STOC, pp. 95–103 (2007); In Submission http://www.cs.brown.edu/~ws/papers/fast_journal.pdf (2009)

  17. Mathieu, C., Schudy, W.: Yet Another Algorithm for Dense Max Cut: Go Greedy. In: Proc. 19th ACM-SIAM SODA, pp. 176–182 (2008)

    Google Scholar 

  18. Opatrny, J.: Total Ordering Problem. SIAM J. Comput. 8, 111–114 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Bonn, Germany

    Marek Karpinski

  2. IBM T.J. Watson Research Center, USA

    Warren Schudy

Authors
  1. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Warren Schudy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Liverpool, Ashton Building, L69 3BX, Liverpool, UK

    Leslie Ann Goldberg

  2. Department of Computer Science, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

  3. Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, 15213, Pittsburgh, PA, USA

    R. Ravi

  4. Centre Universitaire d’Informatique,, University of Geneva,, Battelle A 7 route de Drize, 1227, Carouge, Switzerland

    José D. P. Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karpinski, M., Schudy, W. (2011). Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2011 2011. Lecture Notes in Computer Science, vol 6845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22935-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22935-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22934-3

  • Online ISBN: 978-3-642-22935-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation