The following pages link to Étienne Bamas (Q1989356):
Displaying 7 items.
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- (Q5090456) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- Local approximation of the maximum cut in regular graphs (Q5919465) (← links)
- Distributed coloring of graphs with an optimal number of colors (Q6307068) (← links)
- An improved analysis of greedy for online Steiner forest (Q6575206) (← links)
- Santa claus meets makespan and matroids: algorithms and reductions (Q6645460) (← links)
