Pages that link to "Item:Q989538"
From MaRDI portal
The following pages link to Exponential-time approximation of weighted set cover (Q989538):
Displayed 20 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- The Parameterized Complexity of the Rainbow Subgraph Problem (Q2945198) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)