Algorithms for hub label optimization

Maxim Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Cohen et al. developed an O(log n)-approximation algorithm for minimizing the total hub label size (ℓ1 norm). We give O(log n)-approximation algorithms for the problems of minimizing the maximum label (ℓ norm) and minimizing ℓp and ℓq norms simultaneously..

Original languageEnglish (US)
Title of host publicationAutomata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings
Pages69-80
Number of pages12
EditionPART 1
DOIs
StatePublished - 2013
Event40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 - Riga, Latvia
Duration: Jul 8 2013Jul 12 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume7965 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
Country/TerritoryLatvia
CityRiga
Period7/8/137/12/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Algorithms for hub label optimization'. Together they form a unique fingerprint.

Cite this