Titel

Merkliste
1 Ergebnisse

Almost Optimal Massively Parallel Algorithms for k-Center C..:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,

Haqi, Alireza ; Zarrabi-Zadeh, Hamid - p. 239-247 , 2023

Link: https://dl.acm.org/doi/10.1145/3558481.3591077

RT 
T1 <cTitle>Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures</cTitle>: T1 <Title>Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-3591077&Exemplar=1&LAN=DE
				
A1 Haqi, Alireza
A1 Zarrabi-Zadeh, Hamid
PB ACM
YR 2023
K1 $k$-center clustering
K1 diversity maximization
K1 massively parallel algorithms
K1 maximal independent set
K1 Theory of computation
K1 Design and analysis of algorithms
K1 Parallel algorithms
K1 Massively parallel algorithms
K1 Mathematics of computing
K1 Discrete mathematics
K1 Graph theory
K1 Approximation algorithms
K1 Approximation algorithms analysis
K1 Facility location and clustering
K1 Information systems
K1 Information retrieval
K1 Retrieval models and ranking
K1 Information retrieval diversity
SP 239
OP 247
LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3558481.3591077
DO https://dl.acm.org/doi/10.1145/3558481.3591077
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)