688 citations
- Centre de Recherche en Mathématiques de la DécisionFR133 papers
- Centre National de la Recherche ScientifiqueFR86 papers
- Université Paris Sciences et LettresFR31 papers
- Centre de Recherche en Économie et StatistiqueFR23 papers
- Université Paris CitéFR17 papers
- École PolytechniqueFR15 papers
- Institut Universitaire de FranceFR10 papers
- Sorbonne UniversitéFR10 papers
- University of WarwickGB10 papers
- Centre de Mathématiques Appliquées de l'École polytechniqueFR7 papers
- Institut national de recherche en sciences et technologies du numériqueFR7 papers
- LamsadeFR7 papers
11 papers · 1 filter
Updating Lower and Upper Bounds for the Job-Shop Scheduling Problem Test Instances
Marc-Emmanuel Coupvent des Graviers, Lotfi Kobrosly, Christophe Guettier +1
The Job-Shop Scheduling Problem (JSSP) and its variant, the Flexible Job-Shop Scheduling Problem (FJSSP), are combinatorial optimization problems studied thoroughly in the literatu…
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
Syamantak Das, Nikhil Kumar, Daniel Vaz
Flow sparsification is a classic graph compression technique which, given a capacitated graph on terminals, aims to construct another capacitated graph , called a flow s…
Relaxed Agreement Forests
Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk +3
There are multiple factors which can cause the phylogenetic inference process to produce two or more conflicting hypotheses of the evolutionary history of a set X of biological ent…
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet +6
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Cliq…
Group-Harmonic and Group-Closeness Maximization -- Approximation and Engineering
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo +3
Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing cen…
Faster Algorithms for Parametric Global Minimum Cut Problems
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
The parametric global minimum cut problem concerns a graph where the cost of each edge is an affine function of a parameter for some fixed dimension…