Pages that link to "Item:Q1941381"
From MaRDI portal
The following pages link to Fast algorithms for min independent dominating set (Q1941381):
Displayed 19 items.
- Completion and decomposition of hypergraphs into dominating sets of graphs (Q322230) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- The many facets of upper domination (Q1704853) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Dominating problems in swapped networks (Q2629991) (← links)
- \textsc{MAX MIN} vertex cover and the size of Betti tables (Q2660135) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← 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)