Matching and P2-packing: Weighted versions

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

Volumn 6842 LNCS, Issue , 2011, Pages 343-353

  Feng, Qilong ^a   Wang, Jianxin ^a   Chen, Jianer ^a,b  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; GENERAL GRAPH; GRAPH MATCHING PROBLEMS; GRAPH MATCHINGS; NEW STUDY; PACKING PROBLEMS; PARAMETERIZED ALGORITHM; POLYNOMIAL-TIME ALGORITHMS; UPPER BOUND; PARTITIONING ALGORITHMS;

ALGORITHMS; GRAPH THEORY; COMBINATORIAL MATHEMATICS; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

PATTERN MATCHING; PARAMETER ESTIMATION;

EID: 80051988411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22685-4_31     Document Type: Conference Paper

References (20)

1. Bar-Yehuda, r., Halldórsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling Split intervals. in: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 732-741. ACM Press, New York (2002)
2. Bazgan, C., Hassin, R., Monnot, J.: Approximation algorithms for some vehicle routing problems. Discrete Appl. Math. 146, 27-42 (2005)
3. Chen, J., Lu, S.: Improved parameterized set splitting algorithms: A probabilistic approach. Algorithmica 54(4), 472-489 (2008)
4. De Bontridder, K., Halldórsson, B., Lenstra, J., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program, Ser. B 98, 477-491 (2003)
5. Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.)WG 2004. LNCS, vol. 3353, pp. 235-244. Springer, Heidelberg (2004) (Pubitemid 39743797)
6. Feng, Q., Liu, Y., Lu, S., Wang, J.: Improved deterministic algorithms for weighted matching and packing problems. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol. 5532, pp. 211-220. Springer, Heidelberg (2009)
7. Gabow, H.: Data structures for weighted matching and nearest common ancestoers. In: Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434-443. ACM Press, New York (1990)
8. Fernau, H., Raible, D.: A parameterized perspective on packing paths of length two. Journal of Combinatorial Optimization 18(4), 319-341 (2009)
9. Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Appl. Math. 154, 971-979 (2006)
10. Hell, P., Kirkpatrick, D.: On the complexity of a generalized matching problem. In: Mitzenmacher, M. (ed.) Proc. 10th Annual ACM Symposium on Theory of Computing, pp. 240-245. ACM Press, New York (1978)
11. Hurkens, C., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with application to worst case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathmatics 2, 68-72 (1989)
12. Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters 49, 309-318 (1994)
13. Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halld´orsson, M.M., Ing´olfsd´ottir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575-586. Springer, Heidelberg (2008)
14. Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM Journal on Computing 12, 601-609 (1983)
15. Van Leeuwen, J.: Graph algorithms. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 525-631 (1990)
16. k partitioning problem and related problems in bipartite graphs. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 422-433. Springer, Heidelberg (2007)
17. Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. 39th Annual Symposium on Foundatins of Computer Science, pp. 182-190. IEEE Press, New York (1995)
18. Prieto, E., Sloper, C.: Looking at the stars. Theoretical Computer Science 351, 437-445 (2006)
19. 3k) parameterized algorithm for 3-set packing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 82-93. Springer, Heidelberg (2008)
20. Wang, J., Ning, D., Feng, Q., Chen, J.: An improved parameterized algorithm for a generalized matching problem. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 212-222. Springer, Heidelberg (2008)