Fast Approximation Algorithms for p-Centers in Large $$\delta $$-Hyperbolic Graphs (English)
- New search for: Edwards, Katherine
- Further information on Edwards, Katherine:
-
https://orcid.org/0000-0002-7931-7312
- New search for: Kennedy, W. Sean
- New search for: Saniee, Iraj
- New search for: Edwards, Katherine
- Further information on Edwards, Katherine:
-
https://orcid.org/0000-0002-7931-7312
- New search for: Kennedy, W. Sean
- New search for: Saniee, Iraj
In:
Algorithmica
;
80
, 12
; 3889-3907
;
2018
-
ISSN:
- Article (Journal) / Print
-
Title:Fast Approximation Algorithms for p-Centers in Large $$\delta $$-Hyperbolic Graphs
-
Contributors:
-
Published in:Algorithmica ; 80, 12 ; 3889-3907
-
Publisher:
- New search for: Springer US
- New search for: Springer
-
Place of publication:New York, N.Y.
-
Publication date:2018
-
ISSN:
-
ZDBID:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 54.00
- Further information on Basic classification
- New search for: 770/3145/3155
-
Keywords:
-
Classification:
BKL: 54.00 Informatik: Allgemeines Local classification TIB: 770/3145/3155 -
Source:
Table of contents – Volume 80, Issue 12
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 3437
-
Fault-Tolerant Approximate Shortest-Path TreesBilò, Davide / Gualà, Luciano / Leucci, Stefano / Proietti, Guido et al. | 2017
- 3461
-
The Densest Subgraph Problem with a Convex/Concave Size FunctionKawase, Yasushi / Miyauchi, Atsushi et al. | 2017
- 3481
-
A Polynomial Kernel for Trivially Perfect EditingDrange, Pål Grønås / Pilipczuk, Michał et al. | 2017
- 3525
-
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix MultiplicationComin, Carlo / Rizzi, Romeo et al. | 2018
- 3563
-
Quantifying Competitiveness in Paging with Locality of ReferenceAlbers, Susanne / Frascaria, Dario et al. | 2018
- 3597
-
Parameterized Complexity of Length-bounded Cuts and MulticutsDvořák, Pavel / Knop, Dušan et al. | 2018
- 3618
-
The Sandwich Problem for Decompositions and Almost Monotone PropertiesChudnovsky, Maria / de Figueiredo, Celina M. H. / Spirkl, Sophie et al. | 2018
- 3646
-
Canonical Representations for Circular-Arc Graphs Using Flip SetsChandoo, Maurice et al. | 2018
- 3673
-
Self-Stabilizing Balls and Bins in BatchesBerenbrink, Petra / Friedetzky, Tom / Kling, Peter / Mallmann-Trenn, Frederik / Nagel, Lars / Wastell, Chris et al. | 2018
- 3704
-
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and ApplicationsDehghan, Ali / Sadeghi, Mohammad-Reza / Ahadi, Arash et al. | 2018
- 3728
-
Dynamic Path Queries in Linear SpaceHe, Meng / Munro, J. Ian / Zhou, Gelin et al. | 2018
- 3766
-
Path Refinement in Weighted RegionsGheibi, Amin / Maheshwari, Anil / Sack, Jörg-Rüdiger / Scheffer, Christian et al. | 2018
- 3803
-
Quasimetric Embeddings and Their ApplicationsMémoli, Facundo / Sidiropoulos, Anastasios / Sridhar, Vijay et al. | 2018
- 3825
-
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline ConstraintsKacem, Imed / Kellerer, Hans et al. | 2018
- 3844
-
-Max-Cut: An -Time Algorithm and a Polynomial KernelSaurabh, Saket / Zehavi, Meirav et al. | 2018
- 3844
-
$$(k,n-k)$$-Max-Cut: An $$\mathcal{O}^*(2^p)$$-Time Algorithm and a Polynomial KernelSaurabh, Saket / Zehavi, Meirav et al. | 2018
- 3861
-
Online Packet Scheduling for CIOQ and Buffered Crossbar SwitchesAl-Bawani, Kamal / Englert, Matthias / Westermann, Matthias et al. | 2018
- 3889
-
Fast Approximation Algorithms for p-Centers in Large -Hyperbolic GraphsEdwards, Katherine / Kennedy, W. Sean / Saniee, Iraj et al. | 2018
- 3889
-
Fast Approximation Algorithms for p-Centers in Large $$\delta $$-Hyperbolic GraphsEdwards, Katherine / Kennedy, W. Sean / Saniee, Iraj et al. | 2018
- 3908
-
Counting Minimum Weight ArborescencesHayashi, Koyo / Iwata, Satoru et al. | 2018
- 3920
-
Lift-and-Project Methods for Set Cover and KnapsackChlamtáč, Eden / Friggstad, Zachary / Georgiou, Konstantinos et al. | 2018
- 3943
-
Extreme Witnesses and Their ApplicationsLingas, Andrzej / Persson, Mia et al. | 2018
- 3958
-
Editor’s Note| 2018
- 3959
-
The Fast Search Number of a Complete k-Partite GraphXue, Yuan / Yang, Boting / Zhong, Farong / Zilles, Sandra et al. | 2018