New hardness results for diophantine approximation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 98-110

  Eisenbrand, Friedrich ^a   Rothvoß, Thomas ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS AND COMPLEXITY; CLASSICAL PROBLEMS; DECISION VERSION; DIOPHANTINE APPROXIMATION; ERROR BOUND; HARDNESS RESULT; MIXING SET; NP COMPLETE; NP-HARD; OPEN PROBLEMS; OPTIMIZATION PROBLEMS; SIMULTANEOUS DIOPHANTINE APPROXIMATION;

APPROXIMATION THEORY; CARBON FIBER REINFORCED PLASTICS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; HARDNESS; NUMBER THEORY; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350606874     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_8     Document Type: Conference Paper

References (22)

1. ∞). Information Processing Letters 101(4), 174-179 (2007)
2. Conforti, M., Di Summa, M., Wolsey, L.A.: The mixing set with flows. SIAM Journal on Discrete Mathematics 21(2), 396-407 (2007) (electronic)
3. Conforti, M., Summa, M.D., Wolsey, L.A.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 435-449. Springer, Heidelberg (2008)
4. Conforti, M., Zambelli, G.: The mixing set with divisible capacities: a simple approach (manuscript)
5. ∞ to within almost-polynomial factors is NP-hard. Theoretical Computer Science 285(1), 55-71 (2000); Algorithms and complexity, Rome (2000)
6. Eisenbrand, F., Rothvoß, T.: Static-priority realtime-scheduling: Response time computation is NP-hard. In: RTSS 2008 (2008)
7. Frank, A., Tardos, É.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7, 49-65 (1987)
8. Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, 2nd edn. Algorithms and Combinatorics, vol. 2. Springer, Berlin (1993)
9. Günlük, O., Pochet, Y.: Mixing mixed-integer inequalities. Mathematical Programming. A Publication of the Mathematical Programming Society 90(3, Ser. A), 429-457 (2001)
10. Heath-Brown, D.R.: The number of primes in a short interval. Journal für die Reine und Angewandte Mathematik 389, 22-63 (1988)
11. Heath-Brown, D.R., Iwaniec, H.: On the difference between consecutive primes. American Mathematical Society. Bulletin. New Series 1(5), 758-760 (1979)
12. Henk, M.,Weismantel, R.: Diophantine approximations and integer points of cones. Combinatorica 22(3), 401-407 (2002)
13. Kannan, R.: Polynomial-time aggregation of integer programming problems. Journal of the Association for Computing Machinery 30(1), 133-145 (1983)
14. Lagarias, J.C.: The computational complexity of simultaneous Diophantine approximation problems. SIAM Journal on Computing 14(1), 196-209 (1985)
15. Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515-534 (1982)
16. Manders, K.L., Adleman, L.: NP-complete decision problems for binary quadratics. Journal of Computer and System Sciences 16(2), 168-184 (1978)
17. Miller, A.J., Wolsey, L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Mathematical Programming 98(1-3, Ser. B), 73-88 (2003); Integer programming, Pittsburgh, PA (2002)
18. Niven, I., Zuckerman, H.S., Montgomery, H.L.: An introduction to the theory of numbers, 5th edn. John Wiley & Sons Inc., New York (1991)
19. Pochet, Y., Wolsey, L.A.: Production planning by mixed integer programming. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)
20. Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem (extended abstract). In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 66-75. Springer, Heidelberg (1996)
21. Rössner, C., Seifert, J.P.: Approximating good simultaneous Diophantine approximations is almost NP-hard. In: Penczek, W., Szałas, A. (eds.) MFCS 1996. LNCS, vol. 1113, pp. 494-505. Springer, Heidelberg (1996)
22. Zhao, M., de Farias Jr., I.R.: The mixing-MIR set with divisible capacities. Mathematical Programming. A Publication of the Mathematical Programming Society 115(1, Ser. A), 73-103 (2008)