ANR project SAGA

Structural Approximation for Geometric Algorithms.

Jeune chercheur project of Nabil H. Mustafa

(in collaboration with Lilian Buzer, Xavier Goaoc, Claire Mathieu, Frédéric Meunier)



Combinatorial optimization arises naturally in a variety of resource management problems in public transportation companies, industrial manufacturing, financial and health-care institutions. Standing out are two categories of optimization problems, packing and covering, with applications in material and manpower planning, scheduling, routing, investment and resource allocation. The sad fact is that these problems are not only NP-hard, but also provably hard to approximate: for instance, no algorithm can approximate set-cover within a logarithmic multiplicative factor or independent set within a polynomial multiplicative factor. Even worse, with the proliferation of ubiquitous data-collecting devices and fast distributed data-sharing capabilities, the inputs to these problems are so large and complex that traditional computational ideas are infeasible. The task of finding efficient, reliable (provably good) and flexible solutions to packing and covering problems remains a challenge with high potential impact.

One key to avoiding the inherent NP-hardness of these combinatorial problems is to take into account the geometric structure of data that exists in many applications. Such structures, however, become very large with data increases (which, e.g., for business data doubles worldwide every 1.2 years). This dismal state of affairs in theory then translates current applications still using heuristics with the hope (and no guarantees) that they would run fast and produce good-quality solutions. Recent effective approaches to large computational problems therefore rely on structures which are provably small; hence the field of streaming algorithms computes small `sketches' of data, or sub-linear algorithms that even avoid looking at the entire data using structures called epsilon-nets. The core of both these approaches is to show that the structural essence of the entire data can be captured by a small-sized subset. Closer to our theme, the key to the resolution of a long-standing open problem on minimum set-cover for disks was another small-sized structure, namely geometric separators.

The goal of this project is the design of provably efficient and reliable algorithms for packing and covering problems through the study of small-sized structural approximations of geometric data. This involves the analysis of geometric data (e.g., epsilon-nets) to construct small-sized geometric structures (e.g., separators) to design efficient algorithms for packing and covering problems for reliable software solution. A successful completion of this proposal would entail: new structural understanding of geometric data; leading directly to better algorithms for problems on geometric data; careful implementation and algorithmic fine-tuning; solving instances of specific problems of relevance to industry; and finally integration into the state-of-the-art libraries and technologies.

Doctorants

Funded:

Associated:

Internships:

Scientific Visits and Collaboration.



Workshops



Software

  1. ENET: a near-linear time algorithm for epsilon-nets for disks in the plane.

  2. DNET: algorithms for computing hitting-sets for disks in the plane.


Publications (HAL pour les publications sous SAGA)


    All related publications need to mention the support from the project as follows:
    Supported by the French ANR jeune chercheur grant ANR SAGA JCJC-14-CE25-0016-01.

    2019

  1. Theorems of Caratheodory, Helly and Tverberg without dimension. (Karim Adiprasito, Imre Barany, Nabil H. Mustafa).
    Discrete and Computational Geometry, to appear.

  2. Maximizing Covered Area in a Euclidean Plane with Connectivity Constraint. (Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph Mitchell, Nabil H. Mustafa).
    Proc. of the 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX '19), 2019.

  3. Computing Optimal Epsilon-nets is as Easy as Finding an Unhit Set. (Nabil H. Mustafa).
    Proc. of the 46th International Colloquium on Automata, Languages and Programming (ICALP '19), 2019.

  4. Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. (Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa).
    Discrete and Computational Geometry, vol 61, pp. 756-777, 2019.

  5. Optimal Bounds for VC-dimensions of Unions. (Monika Csikos, Andrey Kupavskii, Nabil H. Mustafa).
    Journal of Machine Learning Research (JMLR), vol 20, 2019.

  6. The Discrete Yet Ubiquitous Theorems of Caratheodory, Helly, Sperner, Tucker and Tverberg. (Jesus de Loera, Xavier Goaoc, Frederic Meunier, Nabil H. Mustafa).
    Bulletin of the American Mathematical Society, vol. 56, pp. 415-511, 2019.

  7. Bounding the size of an almost-equidistant set in Euclidean space. (Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel).
    Combinatorics, Probability and Computing, vol 28, pp. 280-286, 2019.

  8. Theorems of Caratheodory, Helly and Tverberg without dimension. (Karim Adiprasito, Imre Barany, Nabil H. Mustafa).
    Proc. of the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA '19), 2019.

  9. On a Problem of Danzer. (Nabil H. Mustafa, Saurabh Ray).
    Combinatorics, Probability and Computing, vol. 28, pp. 473-482, 2019.


    2018

  10. A simple proof of optimal epsilon-nets. (Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh).
    Combinatorica, vol 38, pp. 1269-1277, 2018.

  11. On a Problem of Danzer. (Nabil H. Mustafa, Saurabh Ray).
    Proc. of the 26th Annual Symposium on Algorithms (ESA '18), 2018.

  12. Optimality of Geometric Local Search. (Bruno Jartoux, Nabil H. Mustafa).
    Proc. of the 34th ACM Symposium on Computational Geometry (SoCG '18), 2018.

  13. Integer and Mixed Integer Tverberg Numbers. (Jesús A. De Loera, Thomas Hogan, Frédéric Meunier, Nabil H. Mustafa).
    34th European Workshop on Computational Geometry (EuroCG), 2018.

  14. Practical and Efficient Algorithms for the Geometric Hitting Set Problem. (Norbert Bus, Nabil H. Mustafa, Saurabh Ray).
    Discrete Applied Mathematics, vol 240, pp. 25-32, 2018.

    2017

  15. Combinatorics of Local Search: A 4-Local Hall's Theorem for Planar Graphs. (Daniel Antunes, Claire Mathieu, Nabil H. Mustafa).
    Proc. of the 25th Annual Symposium on Algorithms (ESA '17), 2017.

  16. Epsilon-Mnets: Hitting geometric set systems with subsets. (Nabil H. Mustafa, Saurabh Ray).
    Discrete and Computational Geometry, vol 57, pp. 625-640, 2017.

  17. Limits of Local Search: Quality and Efficiency. (Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray).
    Discrete and Computational Geometry, vol 57, pp. 607-624, 2017.

  18. Shallow Packings, Semialgebraic Set Systems, Macbeath Regions and Polynomial Partitioning. (Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa).
    Proc. of the 33rd ACM Symposium on Computational Geometry (SoCG '17), 2017.

  19. Near-optimal lower bounds for epsilon-nets for half-spaces and low complexity set systems. (Andrey Kupavskii, Nabil H. Mustafa, Janos Pach).
    Book chapter in A Journey Through Discrete Mathematics: A Tribute to Jirí Matousek, Springer, 2017. Book link.

  20. Epsilon-approximations and epsilon-nets. (Nabil H. Mustafa, Kasturi Varadarajan).
    Book chapter in Handbook of Discrete and Computational Geometry, Third Edition, CRC Press, 2017. arXiv version.

    2016

  21. A Simple Proof of the Shallow Packing Lemma. (Nabil H. Mustafa).
    Discrete and Computational Geometry, vol. 55(3), pp. 739-743, 2016.

  22. On the Zarankiewicz Problem for Intersection Hypergraphs. (Nabil H. Mustafa, Janos Pach).
    Journal of Combinatorial Theory Series A, vol 141, pp. 1-7, 2016.

  23. Tighter Estimates for Epsilon-nets for Disks. (Norbert Bus, Saurabh Ray).
    Computational Geometry: Theory and Applications, vol. 53, pp. 27-35, 2016.

  24. An Optimal Generalization of the Colorful Caratheodory's Theorem. (Nabil H. Mustafa, Saurabh Ray).
    Discrete Mathematics, 339(4), pp. 1300-1305, 2016.

  25. New Lower Bounds for Epsilon-nets. (Andrey Kupavskii, Nabil H. Mustafa, Janos Pach).
    Proc. of the 32nd ACM Symposium on Computational Geometry (SoCG '16), 2016.

    2015

  26. QPTAS for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. (Nabil H. Mustafa, Rajiv Raman, Saurabh Ray).
    SIAM Journal on Computing, 44(6), pp. 1650-1669, 2015.

  27. K-Centerpoints Conjectures for Pointsets in R^d. (Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir).
    International Journal of Computational Geometry and Applications, vol. 25(3), pp. 163-185, 2015.

  28. IlluminationCut. (Norbert Bus, Venceslas Biri).
    Proc. of the 36th Annual Conference of the European Association for Computer Graphics (Eurographics '15), 2015.

  29. On the Zarankiewicz Problem for Intersection Hypergraphs. (Nabil H. Mustafa, Janos Pach).
    Proc. of the 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), 2015.

  30. Geometric Hitting Sets for Disks: Theory and Practice. (Norbert Bus, Nabil H. Mustafa, Saurabh Ray).
    Proc. of the 23rd European Symposium on Algorithms (ESA '15), 2015.

  31. Improved Local-Search for Geometric Hitting Set. (Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray).
    Proc. of the 32st International Symposium on Theoretical Aspects of Computer Science (STACS '15), 2015.