( en | de | ru )

 

Disambiguation of "Angelidakis, Haris"

Author of the publication

copydeleteadd this publication to your clipboard
A Technique for Obtaining True Approximations for k-Center with Covering Constraints.

, , , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 52-65. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

József Haris

Haris Pervaiz

Cordula Harisch

Victor Harison

Dimitrios Hariskos

 

Other publications of authors with the same name

Node Connectivity Augmentation via Iterative Randomized Rounding., , and . CoRR, (2021)Improved approximation algorithms for two Euclidean k-Center variants., , and . CoRR, (2021)Node connectivity augmentation via iterative randomized rounding., , and . Math. Program., 199 (1): 995-1031 (May 2023)A Technique for Obtaining True Approximations for k-Center with Covering Constraints., , , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 52-65. Springer, (2020)Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings.. CoRR, (2018)An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut., , and . CoRR, (2016)Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem., , , , and . ESA, volume 144 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut., , and . IPCO, volume 10328 of Lecture Notes in Computer Science, page 39-50. Springer, (2017)A technique for obtaining true approximations for k-center with covering constraints., , , and . Math. Program., 192 (1): 3-27 (2022)Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture., , and . SOSA, page 196-203. SIAM, (2021)