메뉴 건너뛰기




Volumn 15, Issue , 2004, Pages 781-790

Quasiconvex Analysis of Backtracking Algorithms

Author keywords

[No Author keywords available]

Indexed keywords

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

EID: 1842487303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (19)
  • 1
    • 51249168376 scopus 로고
    • Helly-type theorems and generalized linear programming
    • N. Amenta. Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12:241-261, 1994.
    • (1994) Discrete Comput. Geom. , vol.12 , pp. 241-261
    • Amenta, N.1
  • 2
    • 0002935217 scopus 로고    scopus 로고
    • Optimal point placement for mesh smoothing
    • February, arXiv:cs.CG/9809081
    • 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.
    • (1999) J. Algorithms , vol.30 , Issue.2 , pp. 302-322
    • Amenta, N.1    Bern, M.W.2    Eppstein, D.3
  • 3
    • 0032785513 scopus 로고    scopus 로고
    • Finding maximum independent sets in sparse and general graphs
    • January
    • 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.
    • (1999) Proc. 10th ACM-SIAM Symp. Discrete Algorithms
    • Beigel, R.1
  • 4
    • 84958037108 scopus 로고    scopus 로고
    • Optimal Möbius transformations for information visualization and meshing
    • Springer-Verlag, Lecture Notes in Computer Science 2125, August, arXiv:cs.CG/0101006
    • 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.
    • (2001) Proc. 7th Worksh. Algorithms and Data Structures , pp. 14-25
    • Bern, M.W.1    Eppstein, D.2
  • 5
    • 0037700437 scopus 로고    scopus 로고
    • Optimized color gamuts for tiled displays
    • ACM, arXiv:cs.CG/0212007. To appear
    • 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.
    • (2003) Proc. 19th Symp. Computational Geometry
    • Bern, M.W.1    Eppstein, D.2
  • 6
    • 33846572545 scopus 로고    scopus 로고
    • XR - Exact real arithmetic
    • January
    • K. M. Briggs. XR - exact real arithmetic. Open source Python and C++ software, January 2002, http://members.lycos.co.uk/keithmbriggs/XR.html.
    • (2002) Open Source Python and C++ Software
    • Briggs, K.M.1
  • 7
    • 0038077524 scopus 로고    scopus 로고
    • Algorithms for k-colouring and finding maximal independent sets
    • ACM and SIAM, January
    • 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.
    • (2003) Proc. 14th Symp. Discrete Algorithms , pp. 456-457
    • Byskov, J.M.1
  • 10
    • 33746393832 scopus 로고    scopus 로고
    • Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
    • ACM and SIAM, January, arXiv:cs.DS/0009006
    • 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.
    • (2001) Proc. 12th Symp. Discrete Algorithms , pp. 329-337
    • Eppstein, D.1
  • 11
    • 84958041419 scopus 로고    scopus 로고
    • Small maximal independent sets and faster exact graph coloring
    • Springer-Verlag, Lecture Notes in Computer Science 2125, August, arXiv:cs.DS/0011009
    • 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.
    • (2001) Proc. 7th Worksh. Algorithms and Data Structures , pp. 462-470
    • Eppstein, D.1
  • 12
    • 1842600502 scopus 로고    scopus 로고
    • The traveling salesman problem for cubic graphs
    • February, arXiv:cs.DS/0302030
    • D. Eppstein. The traveling salesman problem for cubic graphs. ACM Computing Research Repository, February 2003, arXiv:cs.DS/0302030.
    • (2003) ACM Computing Research Repository
    • Eppstein, D.1
  • 13
    • 0029470290 scopus 로고
    • A subexponential algorithm for abstract optimization problems
    • B. Gärtner. A subexponential algorithm for abstract optimization problems. SIAM J. Computing 24:1018-1035, 1995.
    • (1995) SIAM J. Computing , vol.24 , pp. 1018-1035
    • Gärtner, B.1
  • 15
    • 5844406029 scopus 로고
    • A subexponential bound for linear programming
    • Freie Univ. Berlin, Fachb. Mathematik, August
    • 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.
    • (1992) Tech. Rep. B , vol.92 , Issue.17
    • Matoušek, J.1    Sharir, M.2    Welzl, E.3
  • 17
    • 0001038743 scopus 로고
    • Algorithms for maximum independent sets
    • J. Robson. Algorithms for maximum independent sets. J. Algorithms 7:425-440, 1986.
    • (1986) J. Algorithms , vol.7 , pp. 425-440
    • Robson, J.1
  • 18
    • 1842443753 scopus 로고    scopus 로고
    • Python Language Website
    • G. van Rossum et al. Python Language Website. http://www.python.org/.
    • Van Rossum, G.1
  • 19
    • 0033331493 scopus 로고    scopus 로고
    • A probabilistic algorithm for k-SAT and constraint satisfaction problems
    • IEEE, October
    • 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.
    • (1999) Proc. 40th Symp. Foundations of Computer Science , pp. 410-414
    • Schöning, U.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.