Algorithmic and Hardness Results for the Hub Labeling Problem

DOI10.1137/1.9781611974782.94zbMath1410.68273arXiv1611.06605OpenAlexW2952005146MaRDI QIDQ4575837

Haris Angelidakis, Yury Makarychev, Vsevolod Oparin

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.06605

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

This page was built for publication: Algorithmic and Hardness Results for the Hub Labeling Problem