Pages that link to "Item:Q685520"

The following pages link to Approximating the minimum maximal independence number (Q685520):

Displaying 43 items.

• Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
• On the max min vertex cover problem (Q499339) (← links)
• The intractability of computing the Hamming distance (Q557834) (← links)
• A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (Q672019) (← links)
• Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
• Complete partitions of graphs (Q949754) (← links)
• Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
• Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
• On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
• Connected domination of regular graphs (Q1025488) (← links)
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
• The b-chromatic number of a graph (Q1283791) (← links)
• Some APX-completeness results for cubic graphs (Q1566710) (← links)
• On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
• Subset sum problems with digraph constraints (Q1631654) (← links)
• Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
• Sparsification and subexponential approximation (Q1702300) (← links)
• The many facets of upper domination (Q1704853) (← links)
• Independent sets with domination constraints (Q1962033) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
• \textsc{MAX MIN} vertex cover and the size of Betti tables (Q2660135) (← links)
• Consistent simplification of polyline tree bundles (Q2695291) (← links)
• On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
• Upper Domination: Complexity and Approximation (Q2819508) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
• Approximating Alternative Solutions (Q3511329) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
• Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
• Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
• An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
• When polynomial approximation meets exact computation (Q5892165) (← links)
• When polynomial approximation meets exact computation (Q5915964) (← links)
• Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
• Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
• A generalization of maximal independent sets (Q5931790) (← links)
• Smallest independent dominating sets in Kronecker products of cycles (Q5951974) (← links)
• Improved approximations of independent dominating set in bounded degree graphs (Q6550528) (← links)
• Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)