Improved algorithms for path, matching, and packing problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 298-307

  Chen, Jianer ^a   Lu, Songjian ^a   Sze, Sing Hoi ^a   Zhang, Fenghui ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DERANDOMIZATION; DETERMINISTIC ALGORITHMS; DIVIDE-AND-CONQUER TECHNIQUE; K-PATHS; MATCHING PROBLEMS; PACKING PROBLEMS; RANDOMIZED ALGORITHMS;

ALGORITHMS;

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

References (20)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Journal of Random Structures and Algorithms, 3 (1992), pp. 289-304.
2. N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal of the ACM, 42 (1995), pp. 844-856.
3. H. L. Bodlaender, On linear time minor tests with depth-first search, J. Algorithms, 14 (1993), pp. 1-23.
4. J. L. Carter, and M. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences, 18 (1979), pp. 143-154.
5. J. Chen, D. K. Friesen, W. Jia, and I. A. Kanj, Using nondeterminism to design efficient deterministic algorithms, Algorithmica, 40 (2004), pp. 83-97.
6. R. G. Downey, and M. R. Fellows, Parameterized Complexity, Springer, New York, (1999).
7. M. R. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. M. Thilikos, and S Whitesides, Faster fixed-parameter tractable algorithms for matching and packing problems, Lecture Notes in Computer Science, 3221 (ESA 2004), pp. 311-322.
8. M. L. Fredman, J. Komlos, and E. Szemeredi, Storing a sparse table with O(1) worst case access time, Journal of the ACM, 31 (1984), pp. 538-544.
9. G. H. Hardy, and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, (1979).
10. W. Jia, C. Zhang, and J. Chen, An efficient parameterized algorithm for m-set packing, Journal of Algorithms, 50 (2004), pp. 106-117.
11. B. P. Kelley, R. Sharan, R. M. Karp, T. Sittler, D. E. Root, B. R. Stockwell, and T. Ideker, Conserved pathways within bacteria and yeast as revealed by global protein network alignment, Proc. National Academy of Sciences USA, 100 (2003), pp. 11394-11399.
12. J. Kneis, D. Mölle, S. Richter, and P. Rossmanith, Divide-and-color, Lecture Notes in Computer Science, (WG 2006), to appear.
13. I. Koutis, A faster parameterized algorithm for set packing, Information Processing Letters, 94 (2005), pp. 7-9.
14. Y. Liu, S. Lu, J. Chen, and S.-H. Sze, Greedy localization and color-coding: improved matching and packing algorithms, Lecture Notes in Computer Science, 4169 (IWPEC 2006), pp. 84-95.
15. B. Monien, How to find long paths efficiently, Annals of Discrete Mathematics, 25 (1985), pp. 239-254.
16. M. Naor, L. J. Schulman, A. Srinivasan, Splitters and near-optimal derandomization, In Proceedings of the 39th IEEE Annual Symposium on Foundatins of Computer Science, (FOCS 1995), pp. 182-190.
17. A. Nilli, Perfect hashing and probability, Probability and Computing, 3 (1994), pp. 407-409.
18. C. Papadimitriou, and M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, Journal of Computer and System Sciences, 53 (1996), pp. 161-170.
19. J. P. Schmidt, and A. Siegel, The spatial complexity of oblivious k-probe hash functions, SIAM Journal on Computing, 19 (1990), pp. 775-786.
20. J. Scott, T. Ideker, R. M. Karp, and R. Sharan, Efficient algorithms for detecting signaling pathways in protein interaction networks, Journal of Computational Biology, 13 (2006), pp. 133-144.