Dynamic programming and fast matrix multiplication

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

Volumn 4168 LNCS, Issue , 2006, Pages 280-291

  Dorn, Frederic ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

BRANCHWIDTH; MULTIPLICATION; OPTIMIZATION PROBLEMS; SUBSET PROBLEM;

DYNAMIC PROGRAMMING;

EID: 33750721672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_27     Document Type: Conference Paper

References (17)

1. _, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, 2006. manuscript, http://archive.cs.uu.nl/pub/RUU/CS/techreps/ CS-2006/2006-006.pdf.
2. F. DORN AND J. A. TELLE, Two birds with one stone: the best of branchwidth and treewidth with one algorithm, in LATIN'06: 7th Latin American Theoretical Informatics Symposium (Valdivia), vol. 3887 of Lecture Notes in Computer Science, Berlin, 2006, Springer, pp. 386-397.
3. F. V. FOMIN AND D. M. THILIKOS, Dominating sets in planar graphs: branchwidth and exponential speed-up, in SODA'03: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), New York, 2003, ACM, pp. 168-177.
4. F. V. FOMIN AND D. M. THILIKOS, Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up, in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), vol. 3142 of LNCS, Berlin, 2004, Springer, pp. 581-592.
5. _, A simple and fast approach for solving problems on planar graphs, in Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), vol. 2996 of LNCS, Springer, Berlin, 2004, pp. 56-67.
6. 3) time, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), vol. 3580 of LNCS, Springer, Berlin, 2005, pp, 373-384.
7. 2.376), SIAM Journal on Discrete Mathematics, 19 (2005), pp. 900-913.
8. A. ITAI AND M. RODEH, Finding a minimum circuit in a graph, SIAM Journal on Computing, 7 (1978), pp. 413-423.
9. α), in SODA'03: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), New York, 2003, ACM, pp. 158-167.
10. R. SEIDEL, On the all-pairs-shortest-path problem in unweighted undirected graphs, Journal of Computer and System Sciences, 51 (1995), pp. 400-403.
11. P. D. SEYMOUR AND R. THOMAS, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.
12. A. SHOSHAN AND U. ZWICK, All pairs shortest paths in undirected graphs with integer weights, in 40th Annual Symposium on Foundations of Computer Science, (FOCS '99), Lecture Notes in Computer Science, Springer, 1999, pp. 605-615.
13. J. A. TELLE AND A. PROSKUROWSKI, Algorithms for vertex partitioning problems on partial k-trees, SIAM J, Discrete Math, 10 (1997), pp. 529-550.
14. P. M. VAIDYA, Speeding-up linear programming using fast matrix multiplication, in 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 1989, pp. 332-337.
15. (3-δ) time, with applications, 2006. To appear in ACM Symposium on Theory of Computing (STOC 2006), http://www.cs.cmu.edu/ ryanw/max-weight-triangle.pdf.
16. R. WILLIAMS, A new algorithm for optimal constraint satisfaction and its implications, in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), vol. 3142 of LNCS, Springer, Berlin, 2004, pp. 1227-1237.
17. U. ZWICK, All pairs shortest paths using bridging sets and rectangular matrix multiplication, Journal of the ACM, 49 (2002), pp. 289-317.