Pages that link to "Item:Q3183480"
From MaRDI portal
The following pages link to Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480):
Displaying 13 items.
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← 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)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator (Q5415541) (← links)
