暂无分享,去创建一个
[1] Michael R. Fellows,et al. Parameterized learning complexity , 1993, COLT '93.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Gérard D. Cohen,et al. Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity , 2008, Adv. Math. Commun..
[4] Mark G. Karpovsky,et al. On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.
[5] Ge Xia,et al. On the computational hardness based on linear FPT-reductions , 2006, J. Comb. Optim..
[6] Michael A. Henning,et al. Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs , 2014, Graphs Comb..
[7] Béla Bollobás,et al. On separating systems , 2007, Eur. J. Comb..
[8] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[9] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[10] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory A.
[11] Jean-Sébastien Sereni,et al. Identifying and Locating-Dominating Codes in (Random) Geometric Networks , 2009, Comb. Probab. Comput..
[12] Michael R. Fellows,et al. Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.
[13] R. Ravi,et al. Approximation algorithms for the test cover problem , 2003, Math. Program..
[14] V. S. Anil Kumar,et al. Hardness of Set Cover with Intersection 1 , 2000, ICALP.
[15] Cristina Bazgan,et al. Parameterized Approximability of Maximizing the Spread of Influence in Networks , 2013, COCOON.
[16] N. Bousquet. Hitting sets : VC-dimension and Multicut , 2013 .
[17] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[18] J. Moncel. Codes Identifiants dans les Graphes , 2005 .
[19] Gregory Gutin,et al. Parameterizations of Test Cover with Bounded Test Sizes , 2014, Algorithmica.
[20] Liming Cai,et al. The Inapproximability of Non NP-hard Optimization Problems , 1998, ISAAC.
[21] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..
[22] Florent Foucaud,et al. Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes , 2015, J. Discrete Algorithms.
[23] Subhash Khot,et al. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[24] Nicolas Bousquet,et al. VC-dimension and Erdős-Pósa property , 2014, Discret. Math..
[25] Saket Saurabh,et al. Parameterized Study of the Test Cover Problem , 2012, MFCS.
[26] Aline Parreau,et al. Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs , 2015, WG.
[27] Leizhen Cai,et al. Parameterized Complexity of Cardinality Constrained Optimization Problems , 2008, Comput. J..
[28] Daniele Micciancio,et al. The shortest vector in a lattice is hard to approximate to within some constant , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[29] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[30] Fedor V. Fomin,et al. Subexponential algorithms for partial cover problems , 2011, Inf. Process. Lett..
[31] R. Steele. Optimization , 2005 .
[32] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[33] Francesco Maffioli,et al. An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints , 2006, Discret. Appl. Math..
[34] Joachim Kneis,et al. Partial vs. Complete Domination: t-Dominating Set , 2007, SOFSEM.
[35] S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .
[36] Gerhard J. Woeginger,et al. The VC-dimension of Set Systems Defined by Graphs , 1997, Discret. Appl. Math..
[37] Mihalis Yannakakis,et al. On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[38] Aline Parreau,et al. Identifying Codes in Hereditary Classes of Graphs and VC-Dimension , 2014, SIAM J. Discret. Math..
[39] Shay Moran,et al. Hitting Set in hypergraphs of low VC-dimension , 2016, ESA.