Suchergebnisse - k-Center clustering Distributed graph algorithms Shortest path metric*

k-Center Clustering in Distributed Models

Autoren: Biabani, Leyla Paz, Ami Eindhoven University of Technology Eindhoven (TU/e) et al.

Weitere Verfasser: Biabani, Leyla Paz, Ami Eindhoven University of Technology Eindhoven (TU/e) et al.

Quelle: SIROCCO 2024 ; https://hal.science/hal-04799381 ; SIROCCO 2024, May 2024, Vietri sul Mare, Italy. pp.83-100, ⟨10.1007/978-3-031-60603-8_5⟩

Schlagwörter: k-Center clustering Distributed graph algorithms Shortest path metric, k-Center clustering, Distributed graph algorithms, Shortest path metric, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Geographisches Schlagwort: Vietri sul Mare, Italy

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.18031; ARXIV: 2407.18031

Verfügbarkeit: https://hal.science/hal-04799381
https://hal.science/hal-04799381v1/document
https://hal.science/hal-04799381v1/file/2407.18031v1.pdf
https://doi.org/10.1007/978-3-031-60603-8_5

$k$-Center Clustering in Distributed Models

Autoren: Biabani, Leyla Paz, Ami

Index Begriffe: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2407.18031

Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center.

Autoren: Kim, Kangsan Shin, Yongho An, Hyung-Chan

Quelle: Algorithmica; Jul2023, Vol. 85 Issue 7, p1883-1911, 29p

Schlagwörter: APPROXIMATION algorithms, LOCATION problems (Programming), GRAPH algorithms, COMBINATORIAL optimization, ASSIGNMENT problems (Programming), APPROXIMATION theory, COMBINATORICS

Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance.

Autoren: Gudmundsson, Joachim Seybold, Martin P. Wong, Sampson

Quelle: ACM Transactions on Algorithms; Apr2024, Vol. 20 Issue 2, p1-33, 33p

Schlagwörter: DATA structures, POLYNOMIAL time algorithms, PLANAR graphs, GRAPH algorithms, APPROXIMATION algorithms, MATCHING theory, COMPUTATIONAL geometry

Fuzzy median graph algorithm for facility location problem.

Autoren: Mohan, Anandhu Dhanyamol, M. V. Thalapala, Vidya Sagar

Quelle: AIP Conference Proceedings; 2023, Vol. 2875 Issue 1, p1-9, 9p

Schlagwörter: GRAPH algorithms, FUZZY graphs, NP-hard problems, SERVICE stations, FACILITIES, ALGORITHMS

An Effective Way to Large-Scale Robot-Path-Planning Using a Hybrid Approach of Pre-Clustering and Greedy Heuristic.

Autoren: Wang, W. C. Chen, R.

Quelle: Applied Artificial Intelligence; 2020, Vol. 34 Issue 14, p1159-1175, 17p

Schlagwörter: ROBOT motion, K-means clustering, ALGORITHMS

LOCAL SEARCH YIELDS APPROXIMATION SCHEMES FOR κ-MEANS AND κ-MEDIAN IN EUCLIDEAN AND MINOR-FREE METRICS.

Autoren: COHEN-ADDAD, VINCENT KLEIN, PHILIP N. MATHIEU, CLAIRE

Quelle: SIAM Journal on Computing; 2019, Vol. 48 Issue 2, p644-667, 24p

Schlagwörter: PLANAR graphs, EUCLIDEAN metric, LOCATION problems (Programming), COST functions, MEDIAN (Mathematics), POWER (Social sciences)

Multi-relation Graph Summarization.

Autoren: XIANGYU KE KHAN, ARIJIT BONCHI, FRANCESCO

Quelle: ACM Transactions on Knowledge Discovery from Data; Mar2022, Vol. 16 Issue 5, p1-30, 30p

Schlagwörter: LARGE-scale brain networks, HEURISTIC algorithms, APPROXIMATION algorithms, SOCIAL networks, POLYNOMIAL time algorithms, CHARTS, diagrams, etc., GRAPH algorithms, VISUALIZATION

Scaling up network centrality computations – A brief overview.

Autoren: van der Grinten, Alexander Angriman, Eugenio Meyerhenke, Henning

Quelle: IT: Information Technology; May2020, Vol. 62 Issue 3, p189-204, 16p

Schlagwörter: DISTRIBUTED computing, CENTRALITY, SCIENTIFIC method, BIG data, ELECTRONIC data processing

Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams.

Autoren: MARX, DÁNIEL PILIPCZUK, MICHAŁ

Quelle: ACM Transactions on Algorithms; Apr2022, Vol. 18 Issue 2, p1-64, 64p

Schlagwörter: VORONOI polygons, GRAPH algorithms, ALGORITHMS, PLANAR graphs

Self-Representation Based Unsupervised Exemplar Selection in a Union of Subspaces.

Autoren: You, Chong Li, Chi Robinson, Daniel P. et al.

Quelle: IEEE Transactions on Pattern Analysis & Machine Intelligence; May2022, Vol. 44 Issue 5, p2698-2711, 14p

Schlagwörter: SEARCH algorithms, DATA mining, CENTROID, IMAGE reconstruction, COMPUTER vision

Distributed Graph Diameter Approximation.

Autoren: Ceccarello, Matteo Pietracaprina, Andrea Pucci, Geppino et al.

Quelle: Algorithms; Sep2020, Vol. 13 Issue 9, p216-216, 1p

Schlagwörter: DISTRIBUTED algorithms, ALGORITHMS, UNDIRECTED graphs, VECTOR spaces, WEIGHTED graphs, APPROXIMATION algorithms

A data-driven dimensionality-reduction algorithm for the exploration of patterns in biomedical data.

Autoren: Islam, Md Tauhidul Xing, Lei

Quelle: Nature Biomedical Engineering; Jun2021, Vol. 5 Issue 6, p624-635, 12p

An Efficient Cloud Data Center Allocation to the Source of Requests.

Autoren: Gurusamy, Murugaboopathi

Quelle: Journal of Organizational & End User Computing; Jul-Sep2020, Vol. 32 Issue 3, pN.PAG-N.PAG, 1p

Schlagwörter: DATA libraries, SERVER farms (Computer network management), SERVICE level agreements, K-means clustering, GRAPH algorithms, QUALITY of service

CENTRALITY ESTIMATION IN LARGE NETWORKS.

Autoren: BRANDES, ULRIK PICH, CHRISTIAN

Quelle: International Journal of Bifurcation & Chaos in Applied Sciences & Engineering; Jul2007, Vol. 17 Issue 7, p2303-2318, 16p, 3 Diagrams, 2 Charts, 6 Graphs

Schlagwörter: COMPUTER networks, DIGITAL communications, ELECTRONIC data processing, CENTRALITY, OPERATIONS research

Connected k-Center and k-Diameter Clustering.

Autoren: Drexler, Lukas Eube, Jan Luo, Kelin et al.

Quelle: Algorithmica; Nov2024, Vol. 86 Issue 11, p3425-3464, 40p

Schlagwörter: APPROXIMATION algorithms, GEODESY, ALGORITHMS, DATA modeling, MOTIVATION (Psychology), UNDIRECTED graphs

The Shortest-Path Problem : Analysis and Comparison of Methods

Autoren: Arturo Gonzalez-Escribano Diego R. Llanos Hector Ortega-Arranz

Resource Type: eBook.

Schlagworte: Graph algorithms, Paths and cycles (Graph theory)

Categories: MATHEMATICS / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, MATHEMATICS / Applied, MATHEMATICS / Discrete Mathematics

DENSITY-BASED CLUSTERING IN MAPREDUCE WITH GUARANTEES ON PARALLEL TIME, SPACE, AND SOLUTION QUALITY.

Autoren: AGHAMOLAEI, SEPIDEH GHODSI, MOHAMMAD

Quelle: Transactions on Combinatorics; Sep2025, Vol. 14 Issue 3, p135-156, 22p

Schlagwörter: GRAPH connectivity, ALGORITHMS, MACHINERY

The Shortest-Path Problem : Analysis and Comparison of Methods

Autoren: Hector Ortega-Arranz Arturo Gonzalez-Escribano Diego R. Llanos

Resource Type: eBook.

Schlagworte: Computer science, Graph theory, Artificial intelligence, Biomathematics

Categories: MATHEMATICS / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, MATHEMATICS / Applied, MATHEMATICS / Graphic Methods

Universal Algorithms for Clustering Problems.

Autoren: GANESH, ARUN MAGGS, BRUCE M. PANIGRAHI, DEBMALYA

Quelle: ACM Transactions on Algorithms; Apr2023, Vol. 19 Issue 2, p1-46, 46p

Schlagwörter: EUCLIDEAN metric, METRIC spaces, ALGORITHMS, LINEAR programming, MEDIAN (Mathematics)