Faster algebraic algorithms for path and packing problems

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 575-586

  Koutis, Ioannis ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS;

ALGEBRAIC ALGORITHMS; ARITHMETIC CIRCUITS; FREE TERM; PACKING PROBLEMS;

TRANSLATION (LANGUAGES);

EID: 49049085267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_47     Document Type: Conference Paper

References (11)

1. Alon, N., Yuster, R., Zwick, U.: Color coding. Journal of the ACM 42(4), 844-856 (1995)
2. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: SODA 2007: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 298-307 (2007)
3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
4. Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F.A., Stege, U., Thilikos, D.M., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 311-322. Springer, Heidelberg (2004)
5. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. J. Algorithms 50(1), 106-117 (2004)
6. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: WG: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, pp. 58-67 (2006)
7. Koutis, I.: A faster parameterized algorithm for set packing. Information Processing Letters 94(1), 4-7 (2005)
8. Liu, Y., Lu, S., Chen, J., Sze, S.-H.: Greedy localization and color-coding: Improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 84-95. Springer, Heidelberg (2006)
9. Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. J. Comput. Syst. Sci. 53(2), 161-170 (1996)
10. Terras, A.: Fourier Analysis on Finite Groups and Applications. Cambridge University, Cambridge (1999)
11. Valiant, L.G.: Why is boolean complexity difficult? In: Boolean Function Complexity. Lond. Math. Soc. Lecure Note Ser, vol. 169