Pages that link to "Item:Q685520"
From MaRDI portal
The following pages link to Approximating the minimum maximal independence number (Q685520):
Displayed 16 items.
- 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)
- Complete partitions of graphs (Q949754) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← 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)
- Independent sets with domination constraints (Q1962033) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← 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)
- A generalization of maximal independent sets (Q5931790) (← links)
- Smallest independent dominating sets in Kronecker products of cycles (Q5951974) (← links)