Search

Your search keyword '"SANITÀ, LAURA"' showing total 64 results

Search Constraints

Start Over You searched for: Author "SANITÀ, LAURA" Remove constraint Author: "SANITÀ, LAURA" Database Springer Nature eBooks Remove constraint Database: Springer Nature eBooks
64 results on '"SANITÀ, LAURA"'

Search Results

1. On the Number of Degenerate Simplex Pivots

2. Stabilization of Capacitated Matching Games

3. An Efficient Characterization of Submodular Spanning Tree Games

4. Stabilizing Network Bargaining Games by Blocking Players

5. Approximate Deadline-Scheduling with Precedence Constraints

6. Finding Small Stabilizers for Unstable Graphs

7. Better Approximation Algorithms for Technology Diffusion

8. 0/1 Polytopes with Quadratic Chvátal Rank

9. The School Bus Problem on Trees

10. An Exact Algorithm for Robust Network Design

11. Set Covering with Ordered Replacement: Additive and Multiplicative Gaps

12. The Interval Constrained 3-Coloring Problem

13. Local Restoration for Trees and Arborescences

14. On the Complexity of the Asymmetric VPN Problem

15. A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in Time

17. Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition

18. Improving the Cook et al. Proximity Bound Given Integral Valued Constraints

19. The Simultaneous Semi-random Model for TSP

20. Approximate - Now in Any Norm!

21. On the Maximal Number of Columns of a -modular Matrix

23. The Limits of Local Search for Weighted k-Set Packing

24. The Secretary Problem with Distributions

25. A Competitive Algorithm for Throughput Maximization on Identical Machines

26. An Abstract Model for Branch-and-Cut

28. Lattice-Free Simplices with Lattice Width

30. Graph Coloring and Semidefinite Rank

31. A PTAS for the Horizontal Rectangle Stabbing Problem

32. The Two-Stripe Symmetric Circulant TSP is in P

34. Matroid-Based TSP Rounding for Half-Integral Solutions

36. Total Dual Dyadicness and Dyadic Generating Sets

37. SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs

41. Simple Odd -Cycle Inequalities for Binary Polynomial Optimization

42. On the Complexity of Separation from the Knapsack Polytope

43. Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems

45. Optimal Item Pricing in Online Combinatorial Auctions

46. A Simple Method for Convex Optimization in the Oracle Model

47. On Circuit Diameter Bounds via Circuit Imbalances

48. On Temporally Connected Graphs of Small Cost

49. Efficient Vertex-Label Distance Oracles for Planar Graphs

50. Buyback Problem with Discrete Concave Valuation Functions

Catalog

Books, media, physical & digital resources