No. Title Author Year
1 Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems Abboud, Amir et al. 2022
2 On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting Cohen-Addad, Vincent et al. 2021
3 Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs Cohen-Addad, Vincent et al. 2019
4 Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs Cohen-Addad, Vincent et al. 2019
5 On the Fixed-Parameter Tractability of Capacitated Clustering Cohen-Addad, Vincent et al. 2019
6 Tight FPT Approximations for k-Median and k-Means Cohen-Addad, Vincent et al. 2019
7 Diameter and k-Center in Sliding Windows Cohen-Addad, Vincent et al. 2016
8 Effectiveness of Local Search for Geometric Optimization Cohen-Addad, Vincent et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI