Quasiconvex Analysis of Backtracking Algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 781-790

  Eppstein, David ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; FUNCTIONS; GRAPH THEORY; PARAMETER ESTIMATION; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

BACKTRACKING ALGORITHMS; QUASICONVEX ANALYSIS;

PROBLEM SOLVING;

EID: 1842487303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. N. Amenta. Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12:241-261, 1994.
2. N. Amenta, M. W. Bern, and D. Eppstein. Optimal point placement for mesh smoothing. J. Algorithms 30(2):302-322, February 1999, arXiv:cs.CG/9809081.
3. R. Beigel. Finding maximum independent sets in sparse and general graphs. Proc. 10th ACM-SIAM Symp. Discrete Algorithms, pp. S856-S857, January 1999, http://www.eecs.uic.edu/~beigel/papers/mis-soda.PS.gz.
4. M. W. Bern and D. Eppstein. Optimal Möbius transformations for information visualization and meshing. Proc. 7th Worksh. Algorithms and Data Structures, pp. 14-25. Springer-Verlag, Lecture Notes in Computer Science 2125, August 2001, arXiv:cs.CG/0101006.
5. M. W. Bern and D. Eppstein. Optimized color gamuts for tiled displays. Proc. 19th Symp. Computational Geometry. ACM, 2003, arXiv:cs.CG/0212007. To appear.
6. K. M. Briggs. XR - exact real arithmetic. Open source Python and C++ software, January 2002, http://members.lycos.co.uk/keithmbriggs/XR.html.
7. J. M. Byskov. Algorithms for k-colouring and finding maximal independent sets. Proc. 14th Symp. Discrete Algorithms, pp. 456-457. ACM and SIAM, January 2003.
8. E. Dantsin and E. A. Hirsch. Algorithms for k-SAT based on covering codes. Preprint 1/2000, Steklov Inst. of Mathematics, 2000, ftp://ftp.pdmi.ras. ru/pub/publicat/preprint/2000/01-00.ps.gz.
9. M. Dickerson, D. Eppstein, M. T. Goodrich, and J. Meng. Confluent drawings: visualizing non-planar diagrams in a planar way. ACM Computing Research Repository, December 2002, arXiv:cs.CG/0212046.
10. D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. Proc. 12th Symp. Discrete Algorithms, pp. 329-337. ACM and SIAM, January 2001, arXiv:cs.DS/0009006.
11. D. Eppstein. Small maximal independent sets and faster exact graph coloring. Proc. 7th Worksh. Algorithms and Data Structures, pp. 462-470. Springer-Verlag, Lecture Notes in Computer Science 2125, August 2001, arXiv:cs.DS/0011009.
12. D. Eppstein. The traveling salesman problem for cubic graphs. ACM Computing Research Repository, February 2003, arXiv:cs.DS/0302030.
13. B. Gärtner. A subexponential algorithm for abstract optimization problems. SIAM J. Computing 24:1018-1035, 1995.
14. J. Gramm, E. A. Hirsch, R. Niedermeier, and P. Rossmanith. Better worst-case upper bounds for MAX-2-SAT. 3rd Worksh. on the Satisfiability Problem, 2000, http://ssor.twi.tudelft.nl/~warners/SAT2000abstr/hirsch.html.
15. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Tech. Rep. B 92-17, Freie Univ. Berlin, Fachb. Mathematik, August 1992.
16. R. Paturi, P. Pudlák, M. E. Saks, and F. s Zane. An improved exponential-time algorithm for k-SAT. Proc. 39th Symp. Foundations of Computer Science, pp. 628-637. IEEE, 1998, http://www.math.cas.cz/~pudlak/ppsz.ps.
17. J. Robson. Algorithms for maximum independent sets. J. Algorithms 7:425-440, 1986.
18. G. van Rossum et al. Python Language Website. http://www.python.org/.
19. U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. Proc. 40th Symp. Foundations of Computer Science, pp. 410-414. IEEE, October 1999.