The following pages link to Laura Sanità (Q344953):
Displayed 43 items.
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- The school bus problem on trees (Q378249) (← links)
- The capacitated orienteering problem (Q496434) (← links)
- Exponentiality of the exchange algorithm for finding another room-partitioning (Q496707) (← links)
- The interval constrained 3-coloring problem (Q500992) (← links)
- Stable routing under the Spanning Tree Protocol (Q613335) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space (Q1785373) (← links)
- Stabilizing network bargaining games by blocking players (Q1801001) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- Better Approximation Algorithms for Technology Diffusion (Q2849353) (← links)
- (Q2861564) (← links)
- An improved LP-based approximation for steiner tree (Q2875185) (← links)
- From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk (Q2884270) (← links)
- (Q2969617) (← links)
- The VPN Problem with Concave Costs (Q3008029) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- An Exact Algorithm for Robust Network Design (Q3091477) (← links)
- The School Bus Problem on Trees (Q3104594) (← links)
- Stabilizing Network Bargaining Games by Blocking Players (Q3186500) (← links)
- Stabilizing Weighted Graphs (Q3387926) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- The Interval Constrained 3-Coloring Problem (Q3557052) (← links)
- On the Complexity of the Asymmetric VPN Problem (Q3638888) (← links)
- (Q4607935) (← links)
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem (Q4636516) (← links)
- On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426) (← links)
- 0/1 Polytopes with Quadratic Chvátal Rank (Q4911536) (← links)
- (Q5002762) (← links)
- (Q5009558) (← links)
- (Q5111735) (← links)
- Opposite Elements in Clutters (Q5219549) (← links)
- Stable Routing and Unique-Max Coloring on Trees (Q5300484) (← links)
- Improved Region-Growing and Combinatorial Algorithms for <i>k</i>-Route Cut Problems (Extended Abstract) (Q5363092) (← links)
- Steiner Tree Approximation via Iterative Randomized Rounding (Q5395705) (← links)
- Finding Small Stabilizers for Unstable Graphs (Q5418992) (← links)
- 0/1 Polytopes with Quadratic Chvátal Rank (Q5739123) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- An efficient characterization of submodular spanning tree games (Q5918917) (← links)
- An efficient characterization of submodular spanning tree games (Q5919387) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Stabilization of capacitated matching games (Q6085999) (← links)