853 citations
- Sorbonne UniversitéFR398 papers
- Centre National de la Recherche ScientifiqueFR380 papers
- Université Paris CitéFR136 papers
- Université Pierre-et-Marie-CurieFR97 papers
- University of EdinburghGB89 papers
- Institut national de recherche en sciences et technologies du numériqueFR85 papers
- Université Paris-SaclayFR67 papers
- University of OxfordGB54 papers
- École PolytechniqueFR50 papers
- Sorbonne Paris CitéFR48 papers
- Massachusetts Institute of TechnologyUS45 papers
- Universidade Federal do Rio de JaneiroBR45 papers
44 papers · 1 filter
Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
Josef Grus, Claire Hanen, Zdeněk Hanzálek
We tackle the problem of non-preemptive periodic scheduling with a harmonic set of periods. Problems of this kind arise within domains of periodic manufacturing and maintenance, an…
Clique percolation method: memory efficient almost exact communities
Alexis Baudin, Maximilien Danisch, Sergey Kirgizov +2
Automatic detection of relevant groups of nodes in large real-world graphs, i.e. community detection, has applications in many fields and has received a lot of attention in the las…
A New Coreset Framework for Clustering
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
Given a metric space, the -clustering problem consists of finding centers such that the sum of the of distances raised to the power of every point to its closest cen…
On Polynomial Modular Number Systems over
Jean Claude Bajard, Jérémy Marrez, Thomas Plantard +1
Since their introduction in 2004, Polynomial Modular Number Systems (PMNS) have become a very interesting tool for implementing cryptosystems relying on modular arithmetic in a sec…
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
We consider the classic Facility Location problem on planar graphs (non-uniform, uncapacitated). Given an edge-weighted planar graph , a set of clients , a set…
Mixed integer formulations using natural variables for single machine scheduling around a common due date
Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum
While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we propose in this work mixed integer formulations.…