Search

Your search keyword '"Claire Mathieu"' showing total 24 results

Search Constraints

Start Over You searched for: Author "Claire Mathieu" Remove constraint Author: "Claire Mathieu" Topic combinatorics Remove constraint Topic: combinatorics
24 results on '"Claire Mathieu"'

Search Results

1. An Approximation Algorithm for Fully Planar Edge-Disjoint Paths

2. Large Very Dense Subgraphs in a Stream of Edges

3. How to aggregate Top-lists: Approximation algorithms via scores and average ranks

4. Semidefinite and linear programming integrality gaps for scheduling identical machines

5. A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

6. A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing

7. Online constrained optimization with recourse

8. Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics

9. Approximating connectivity domination in weighted bounded-genus graphs

10. Lower bounds for randomized algorithms for online chain partitioning

11. An O ( n log n ) approximation scheme for Steiner tree in planar graphs

12. Distortion lower bounds for line embeddings

13. On-line bipartite matching made simple

14. Graph Reconstruction via Distance Oracles

15. On the Number of Indecomposable Permutations with a Given Number of Cycles

16. The min mean-weight cycle in a random network

17. Maximum Matching in Semi-streaming with Few Passes

18. Online Ranking for Tournament Graphs

19. Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack

20. Sherali-adams relaxations of the matching polytope

21. Indecomposable permutations with a given number of cycles

22. Recognizing well-parenthesized expressions in the streaming model

23. Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon

24. On the Relative Strength of Split, Triangle and Quadrilateral Cuts

Catalog

Books, media, physical & digital resources