The following pages link to Viggo Kann (Q293217):
Displayed 18 items.
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- (Q1566709) (redirect page) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Strong lower bounds on the approximability of some NPO PB-complete maximization problems (Q3569014) (← links)
- (Q4258216) (← links)
- (Q4259987) (← links)
- Structure in Approximation Classes (Q4268816) (← links)
- (Q4398359) (← links)
- Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
- (Q4764626) (← links)
- (Q4942660) (← links)
- On the approximability of the maximum common subgraph problem (Q5096796) (← links)
- Structure in approximation classes (Q6085751) (← links)