The following pages link to Fabrizio Grandoni (Q334925):
Displaying 18 items.
- Automata, Languages and Programming (Q5716773) (← links)
- Automata, Languages and Programming (Q5716861) (← links)
- Computing and Combinatorics (Q5717007) (← links)
- How to Sell Hyperedges: The Hypermatching Assignment Problem (Q5741733) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- Algorithms and Computation (Q5897890) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back (Q6075940) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- Approximation Algorithms for Demand Strip Packing (Q6090894) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- Improved Approximation for Two-Edge-Connectivity (Q6411466) (← links)
- Breaching the 2 LMP approximation barrier for facility location with applications to \(k\)-median (Q6538566) (← links)
- Maintaining an EDCS in general graphs: simpler, density-sensitive and with worst-case time bounds (Q6538767) (← links)
- Unsplittable flow on a path: the game! (Q6575112) (← links)
- Unsplittable Euclidean capacitated vehicle routing: a \((2+\varepsilon)\)-approximation algorithm (Q6610331) (← links)
- A 4/3 approximation for 2-vertex-connectivity (Q6638023) (← links)
- A $5/4$ Approximation for Two-Edge-Connectivity (Q6740335) (← links)
