Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 2012: LATIN 2012: Theoretical Informatics pp 556–567Cite as

The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem

  • Conference paper

  • 936 Accesses

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

Abstract

We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with inconsistent information. We present a surprising structural insight showing that the problem is a special case of the minimum vertex cover in hypergraphs with edges of size at most 3. This result leads to combinatorial approximation algorithms for the problem and opens the road to studying the problem as a vertex cover problem.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aharoni, R., Holzman, R., Krivelevich, M.: On a theorem of lovász on covers in tau-partite hypergraphs. Combinatorica 16(2), 149–174 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ailon, N.: Aggregation of partial rankings, p-ratings and top-m lists. Algorithmica 57(2), 284–300 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ailon, N., Avigdor-Elgrabli, N., Liberty, E.: An improved algorithm for bipartite correlation clustering. CoRR, abs/1012.3011 (2010)

    Google Scholar 

  4. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5) (2008)

    Google Scholar 

  5. Ambühl, C., Mastrolilli, M.: Single machine precedence constrained scheduling is a vertex cover problem. Algorithmica 53(4), 488–503 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ambühl, C., Mastrolilli, M., Mutsanas, N., Svensson, O.: Scheduling with Precedence Constraints of Low Fractional Dimension. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 130–144. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Ambühl, C., Mastrolilli, M., Mutsanas, N., Svensson, O.: Precedence constraint scheduling and connections to dimension theory of partial orders. Bulletin of the European Association for Theoretical Computer Science (EATCS) 95, 45–58 (2008)

    Google Scholar 

  8. Ambühl, C., Mastrolilli, M., Svensson, O.: Approximating Precedence-Constrained Single Machine Scheduling by Coloring. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 15–26. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Ambühl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constraint scheduling. In: Proceedings of FOCS 2007, pp. 329–337 (2007)

    Google Scholar 

  10. Bansal, N., Khot, S.: Optimal Long-Code test with one free bit. In: Foundations of Computer Science (FOCS), pp. 453–462 (2009)

    Google Scholar 

  11. Correa, J.R., Schulz, A.S.: Single machine scheduling with precedence constraints. Mathematics of Operations Research 30(4), 1005–1021 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Even, G., Naor, J., Rao, S., Schieber, B.: Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47(4), 585–616 (2000)

    Article  MathSciNet  Google Scholar 

  13. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151–174 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Grötschel, M., Jünger, M., Reinelt, G.: Acyclic subdigraphs and linear orderings: Polytopes, facets, and a cutting plane algorithm. Graphs and Orders, 217–264 (1985)

    Google Scholar 

  15. Guruswami, V., Manokaran, R., Raghavendra, P.: Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph. In: FOCS, pp. 573–582 (2008)

    Google Scholar 

  16. Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line algorithms. Mathematics of Operations Research 22, 513–544 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kann, V.: On the Approximability of NP-Complete Optimization Problems. PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)

    Google Scholar 

  18. Karp, R.: Reducibility Among Combinatorial Problems, pp. 85–103. Plenum Press, NY (1972)

    Google Scholar 

  19. Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC, pp. 95–103 (2007)

    Google Scholar 

  20. Krivelevich, M.: Approximate set covering in uniform hypergraphs. J. Algorithms 25(1), 118–143 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kuhn, F., Mastrolilli, M.: Vertex Cover in Graphs with Locally Few Colors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 498–509. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P. (eds.) Handbooks in Operations Research and Management Science, vol. 4, pp. 445–552. North-Holland (1993)

    Google Scholar 

  23. Lempel, A., Cederbaum, I.: Minimum feedback arc and vertex sets of a directed graph. IEEE Trans. Circuit Theory 4(13), 399–403 (1966)

    Article  MathSciNet  Google Scholar 

  24. Luby, M., Nisan, N.: A parallel approximation algorithm for positive linear programming. In: STOC, pp. 448–457 (1993)

    Google Scholar 

  25. Mastrolilli, M.: The feedback arc set problem with triangle inequality is a vertex cover problem. CoRR, abs/1111.4299 (2011)

    Google Scholar 

  26. Pardalos, P., Du, D.: Handbook of Combinatorial Optimization: Supplement, vol. 1. Springer, Heidelberg (1999)

    Google Scholar 

  27. Plotkin, A., Shmoys, D., Tardos, E.: Fast Approximation Algorithms for Fractional Packing and Covering Problems. Mathematics of Operation Research 20 (1995)

    Google Scholar 

  28. Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling 2(5), 203–213 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  29. Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15(2), 281–288 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  30. Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins Series in the Mathematical Sciences. The Johns Hopkins University Press (1992)

    Google Scholar 

  31. van Zuylen, A., Hegde, R., Jain, K., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. In: SODA, pp. 405–414 (2007)

    Google Scholar 

  32. van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Math. Oper. Res. 34(3), 594–620 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  33. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IDSIA, Lugano, Switzerland

    Monaldo Mastrolilli

Authors
  1. Monaldo Mastrolilli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 50011, Ames, IA, USA

    David Fernández-Baca

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mastrolilli, M. (2012). The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29344-3_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29343-6

  • Online ISBN: 978-3-642-29344-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation