1 citations · 1 across the 7 of their papers we have counts for
1 paper · 2 filters
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
Greedy algorithms efficiently approximate combinatorial optimization problems, but their guarantees weaken when feasibility couples combinatorial structure with global physical con…