Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms

ACM Transactions on Algorithms

Volumn 2, Issue 4, 2006, Pages 492-509

  Eppstein, David ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Irvine   (United States)

Author keywords

Automated analysis of algorithms; Backtracking; Davis Putnam procedures; Method of feasible directions; Multivariate recurrences; Quasiconvex programming; Worst case analysis

Indexed keywords

BACKTRACKING; DAVIS - PUTNAM PROCEDURES; MULTIVARIATE RECURRENCES; QUASICONVEX PROGRAMMING; WORST-CASE ANALYSIS;

ALGORITHMS; ASYMPTOTIC STABILITY; DIGITAL ARITHMETIC; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; REAL TIME SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 33846635384     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1198513.1198515     Document Type: Conference Paper

References (26)

1. AMENTA, N. 1994. Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12, 241-261.
2. AMENTA, N., BERN, M. W., AND EPPSTEIN, D. 1999. Optimal point placement for mesh smoothing. J. Algorithms 30, 2 (Feb.), 302-322.
3. BEIGEL, R. 1999. Finding maximum independent sets in sparse and general graphs. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, S856-S857.
4. BERN, M. W., AND EPPSTEIN, D. 2001. Optimal Möbius transformations for information visualization and meshing. In Proceedings of the 7th Workshop on Algorithms and Data Structures, F. Dehne, J.R. Sack, and R. Tamassia, Eds. Lecture Notes in Computer Science, vol. 2125, Springer-Verlag, 14-25.
5. BERN, M. W., AND EPPSTEIN, D. 2003. Optimized color gamuts for tiled displays. In Proceedings of the 19th Symposium on Computational Geometry. ACM, New York, 274-281.
6. BRIGGS, K. M. 2002. XR - exact real arithmetic. Open source Python and C++ software. http://keithbriggs.info/xml.html.
7. BYSKOV, J. M. 2003. Algorithms for k-colouring and finding maximal independent sets. In Proceedings of the 14th Symposium on Discrete Algorithms. ACM, New York, 456-457.
8. HAN, T. M.-Y. 2004. An optimal randomized algorithm for maximum Tukey depth. In Proceedings of the 15th Symposium on Discrete Algorithms. ACM, New York, 423-429.
9. ANTSIN, E., AND HIRSCH, E. A. 2000. Algorithms for k-SAT based on covering codes. Preprint 1/2000, Steklov Inst. of Mathematics, St. Petersburg.
10. AVIS, M., AND PUTNAM, H. 1960. A computing procedure for quantification theory. J. ACM 7, 3, 201-215.
11. ICKERSON, M., EPPSTEIN, D., GOODRICH, M. T., AND MENG, J. 2005. Confluent drawings: visualizing non-planar diagrams in a planar way. J. Graph Algor. Appli 9, 1, 31-52.
12. EPPSTEIN, D. 2001. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In Proceedings of the 12th Sympsioum on Discrete Algorithms. ACM, New York, 329-337.
13. EPPSTEIN, D. 2003a. Small maximal independent sets and faster exact graph coloring. J. Graph Algor. Appl. 7, 2, 131-140.
14. EPPSTEIN, D. 2003b. The traveling salesman problem for cubic graphs. In Proceedings of the 8th Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 2748. Springer-Verlag, New York, 307-318.
15. EPPSTEIN, D. 2005. Quasiconvex programming. In Combinatorial and Computational Geometry, J. E. Goodman, J. Pach, and E. Welzl, Eds. Number 52 in MSRI Publications. Cambridge Univ. Press, Cambridge, UK, 287-331.
16. GÄRTNER, B. 1995. A subexponential algorithm for abstract optimization problems. SIAM J. Comput. 24, 1018-1035.
17. GRAMM, J., HIRSCH, E. A., NIEDERMEIER, R., AND ROSSMANITH, P. 2000. Better worst-case upper bounds for MAX-2-SAT. In SAT2000: Highlights of Satisfiability Research in the Year 2000, I. P. Gent, H. Van Maaren, and T. Walsh, Eds. IDS Press.
18. GREENE, D. H., AND KNUTH, D. E. 1982. Mathematics for the Analysis of Algorithms. Birkhäuser.
19. ATOUŠEK, J., SHARIR, M., AND WELZL, E. 1992. A subexponential bound for linear programming. Tech. Rep. B 92-17, Freie Univ. Berlin, Fachb. Mathematik. August.
20. OSKEWICZ, M. W., MADIGAN, C. F., ZHAO, Y., ZHANG, L., AND MALIK, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC 2001). ACM, New York, 530-535.
21. PATURI, R., PUDLÁK, P., SAKS, M. E., AND ZANE, F. 1998. An improved exponential-time algorithm for k-SAT. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 628-637.
22. ROBSON, J. 1986. Algorithms for maximum independent sets. J. Algorithms 7, 425-440.
23. SCHÖNING, U. 1999. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proc. 40th Symp. Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 410-414.
24. SHOR, N. Z. 1985. Minimization methods for Non-Differentiable Functions. Springer Series in Computational Mathematics. Springer-Verlag, New York.
25. VAN ROSSUM, G. ET AL. 1995. Python Language Website. http://www.python.org/.
26. ZOUTENDDK, G. 1960. Methods of Feasible Directions: A study in linear and non-linear programming. Elsevier.