Exact algorithms and applications for Tree-like Weighted Set Cover
暂无分享,去创建一个
[1] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[2] Rolf Niedermeier,et al. Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.
[3] W. T. Tutte. An algorithm for determining whether a given binary matroid is graphic. , 1960 .
[4] Michael R. Fellows,et al. Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT , 2003, WG.
[5] Magnns M Hallddrsson. Approximating K-set Cover and Complementary Graph Coloring , .
[6] R. Steele. Optimization , 2005 .
[7] Fabrizio Grandoni,et al. Refined Memorisation for Vertex Cover , 2004, IWPEC.
[8] Rolf Niedermeier,et al. Fixed‐parameter tractability and data reduction for multicut in trees , 2005, Networks.
[9] Anita Schöbel,et al. Set covering with almost consecutive ones property , 2004, Discret. Optim..
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[12] Ton Kloks. Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.
[13] Rolf Niedermeier,et al. Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms , 2004, MFCS.
[14] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[15] H. L. Bodlaender,et al. Treewidth: Algorithmic results and techniques , 1997 .
[16] Arthur F. Veinott,et al. Optimal Capacity Scheduling---II , 1962 .
[17] B. A. Reed,et al. Algorithmic Aspects of Tree Width , 2003 .
[18] Rong-chii Duh,et al. Approximation of k-set cover by semi-local optimization , 1997, STOC '97.
[19] Mihalis Yannakakis,et al. Optimization, Approximation, and Complexity Classes (Extended Abstract) , 1988, STOC 1988.
[20] Roderic D. M. Page,et al. Vertebrate Phylogenomics: Reconciled Trees and Gene Duplications , 2001, Pacific Symposium on Biocomputing.
[21] Rolf Niedermeier,et al. Tree decompositions of graphs: Saving memory in dynamic programming , 2006, Discret. Optim..
[22] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.
[23] Robert E. Bixby,et al. An Almost Linear-Time Algorithm for Graph Realization , 1988, Math. Oper. Res..
[24] Michael R. Fellows,et al. New Directions and New Challenges in Algorithm Design and Complexity, Parameterized , 2003, WADS.
[25] Georg Gottlob,et al. Hypertree Decompositions: A Survey , 2001, MFCS.
[26] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[27] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[28] Dorothea Wagner,et al. Solving Geometric Covering Problems by Data Reduction , 2004, ESA.
[29] Rodney G. Downey,et al. Parameterized complexity for the skeptic , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[30] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..
[31] Ge Xia,et al. Simplicity is Beauty: Improved Upper Bounds for Vertex Cover , 2005 .
[32] Hans L. Bodlaender,et al. Treewidth: Algorithmic Techniques and Results , 1997, MFCS.
[33] Jan Arne Telle,et al. Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems , 1993, WADS.
[34] Fabrizio Grandoni,et al. Refined memorization for vertex cover , 2005, Inf. Process. Lett..