The following pages link to (Q3128896):
Displaying 7 items.
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- (Q5075740) (← links)
