Haris Angelidakis

1. A Technique for Obtaining True Approximations for k-Center with\n Covering Constraints
   2020/07/08 by Georg Anegg, Anegg, Georg, Haris Angelidakis +5 · 4 citations
   Business, Management and Accounting · #68Q25 #68W40 #90C05 #90C27 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Facility Location and Emergency Management #Optimization and Control (math.OC)
2. Algorithmic and Hardness Results for the Hub Labeling Problem
   2016/11/20 by Haris Angelidakis, Yury Makarychev, Angelidakis, Haris +3 · 1 citation
   Computer Science · #Computational Geometry and Mesh Generation #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #Digital Image Processing Techniques #FOS: Computer and information sciences
3. Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings
   2018/07/24 by Haris Angelidakis, Angelidakis, Haris · 1 citation
   Computer Science · #Advanced Graph Theory Research #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems