David Eppstein
Abstract
We consider a class of multivariate recurrences frequently arising in the worst-case analysis of Davis-Putnam-style exponential-time backtracking algorithms for NP-hard problems. We describe a technique for proving asymptotic upper bounds on these recurrences, by using a suitable weight function to reduce the problem to that of solving univariate linear recurrences; show how to use quasiconvex programming to determine the weight function yielding the smallest upper bound; and prove that the resulting upper bounds are within a polynomial factor of the true asymptotics of the recurrence. We develop and implement a multiple-gradient descent algorithm for the resulting quasiconvex programs, using a real-number arithmetic package for guaranteed accuracy of the computed worst-case time bounds.
- Amenta, N. 1994. Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12, 241--261.]]Google Scholar
Digital Library
- Amenta, N., Bern, M. W., and Eppstein, D. 1999. Optimal point placement for mesh smoothing. J. Algorithms 30, 2 (Feb.), 302--322.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Briggs, K. M. 2002. XR---exact real arithmetic. Open source Python and C++ software. http://keithbriggs.info/xml.html.]]Google Scholar
- 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.]] Google ScholarDigital Library
- Chan, 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.]] Google ScholarDigital Library
- Dantsin, E., and Hirsch, E. A. 2000. Algorithms for k-SAT based on covering codes. Preprint 1/2000, Steklov Inst. of Mathematics, St. Petersburg.]]Google Scholar
- Davis, M., and Putnam, H. 1960. A computing procedure for quantification theory. J. ACM 7, 3, 201--215.]] Google ScholarDigital Library
- Dickerson, 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.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- Eppstein, D. 2003a. Small maximal independent sets and faster exact graph coloring. J. Graph Algor. Appl. 7, 2, 131--140.]]Google ScholarCross Ref
- 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.]]Google Scholar
- 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.]]Google Scholar
- Gärtner, B. 1995. A subexponential algorithm for abstract optimization problems. SIAM J. Comput. 24, 1018--1035.]] Google ScholarDigital Library
- 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. IOS Press.]]Google Scholar
- Greene, D. H., and Knuth, D. E. 1982. Mathematics for the Analysis of Algorithms. Birkhäuser.]] Google ScholarDigital Library
- Matouš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.]]Google Scholar
- Moskewicz, 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Robson, J. 1986. Algorithms for maximum independent sets. J. Algorithms 7, 425--440.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- Shor, N. Z. 1985. Minimization methods for Non-Differentiable Functions. Springer Series in Computational Mathematics. Springer-Verlag, New York.]] Google ScholarDigital Library
- van Rossum, G. et al. 1995. Python Language Website. http://www.python.org/.]]Google Scholar
- Zoutendijk, G. 1960. Methods of Feasible Directions: A study in linear and non-linear programming. Elsevier.]]Google Scholar
Index Terms
- Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
Recommendations
Quasiconvex analysis of backtracking algorithms
SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithmsWe consider a class of multivariate recurrences frequently arising in the worst case analysis of Davis-Putnam-style exponential time backtracking algorithms for NP-hard problems. We describe a technique for proving asymptotic upper bounds on these ...
Recurrence equations and their classical orthogonal polynomial solutions
Orthogonal systems and applicationsThe classical orthogonal polynomials are given as the polynomial solutions p"n(x) of the differential equation@s(x)y''(x)+@t(x)y^'(x)+@l"ny(x)=0,where @s(x) is a polynomial of at most second degree and @t(x) is a polynomial of first degree. In this ...
Non-polynomial Worst-Case Analysis of Recursive Programs
We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we ...
Comments