Hardness of fully dense problems

Information and Computation

Volumn 205, Issue 8, 2007, Pages 1117-1129

  Ailon, Nir ^a   Alon, Noga ^a,b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Dense problems; NP hardness

Indexed keywords

COMPUTATIONAL COMPLEXITY;

APPROXIMATION SCHEME; DENSE PROBLEMS; FEEDBACK ARC SET IN TOURNAMENTS; HARDNESS RESULT; HYPERGRAPH COLORING; NP-HARDNESS; PSEUDO RANDOM; RANKING PROBLEMS;

HARDNESS;

EID: 84855202447     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.02.006     Document Type: Article

References (22)

1. N. Ailon, M. Charikar, A. Newman, Aggregating inconsistent information: ranking and clustering, in: Proc. 37th ACM STOC, Baltimore, MD, 2005.
2. N. Alon, Eigenvalues, geometric expanders, sorting in rounds and Ramsey Theory, Combinatorica 6(3) (1986) 207-219.
3. N. Alon, Ranking tournaments, SIAM J. Discrete Math. 20(2005) 137-142. (Pubitemid 46352091)
4. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, R. Yuster, The algorithmic aspects of the Regularity Lemma, in: Proc. 33rd IEEE FOCS, Pittsburgh, IEEE, 1992, pp. 473-481.
5. Also: J. Algorithms 16(1994) 80-109.
6. N. Alon, W. Fernandez de la Vega, R. Kannan, M. Karpinski, Random sampling and approximation of MAX-CSP problems, in: Proc. 34th ACM STOC, 2002, pp. 232-239. (Pubitemid 35009382)
7. N. Alon, A. Shapira, B. Sudakov, Additive approximation for edge-deletion problems, in: Proc. 46th IEEE FOCS, 2005, pp. 419-428. Also: Annals of Mathematics, accepted paper. (Pubitemid 44375752)
8. N. Alon, H. Spencer, The Probabilistic Method, second ed., Wiley, 2000.
9. S. Arora, D. Karger, M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proc. 27th STOC, 1995, pp. 284-293.
10. J. Bang-Jensen, C. Thomassen, Apolynomial algorithm for the 2-Path problem in semicomplete graphs, Proc. SIAM J. Discrete Math. 5(3) (1992) 366-376.
11. P. Charbit, S. Thomasse, A. Yeo, The minimum feedback arc set problem is NP-hard for tournaments, combinatorics, Probab. Comput. 16(2007) 1-4. (Pubitemid 44927085)
12. B. Chor, M. Sudan, Ageometric approach to betweenness, SIAM J. Discrete Math. 11(4) (1998) 511-523.
13. G. Even, J. Naor, M. Sudan, B. Schieber, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica 20(2) (1998) 151-174. (Pubitemid 128663382)
14. W. Fernandez de la Vega, MAX-CUT has a randomized approximation scheme in dense graphs, Random Struct. Algor. 8(1996) 187-198.
15. W. Fernandez de la Vega, R. Kannan, M. Karpinski, S. Vempala, Tensor decomposition and approximation schemes for constraint satisfaction problems, in: Proc. 37th STOC, 2005, pp. 747-754. (Pubitemid 43098648)
16. A. Frieze, R. Kannan, The regularity lemma and approximation schemes for dense problems, in: Proc. 37th FOCS, 1996, pp. 12-22.
17. A. Frieze, R. Kannan, Quick approximation to matrices and applications, Combinatorica 19(2) (1999) 175-220.
18. R. Karp, Reducibility Among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, New York, 1972, 84-104.
19. M. Karpinski, Polynomial time approximation schemes for some dense instances of NP-hard optimization problems, Algorithmica 30(3) (2001) 386-397. (Pubitemid 33710523)
20. C. Kenyon-Mathieu, W. Schudy, How to Rank with Few Errors: A PTAS for Weighted Feedback Arc Set on Tournaments, ECCC Technical Report TR06-144, 2006; Proc. 39th STOC, (2007).
21. J. Opatrny, Total ordering problems, SIAM J. Comput. 8(1) (1979) 111-114.
22. P. Seymour, Packing directed circuits fractionally, Combinatorica 15(2) (1995) 281-288.