search result

Cover von Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs

Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs

Year: 2020
Media group: LIPIcs
Cover von Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension

Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension

Year: 2018
Media group: LIPIcs
Cover von A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs

A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs

Year: 2017
Media group: LIPIcs
Cover von Faster and Simpler Greedy Algorithm for k-Median and k-Means

Faster and Simpler Greedy Algorithm for k-Median and k-Means

Year: 2026
Media group: LIPIcs
Cover von Near-Optimal Bounds for Parameterized Euclidean k-Means

Near-Optimal Bounds for Parameterized Euclidean k-Means

Year: 2026
Media group: LIPIcs
Cover von Dominating Sets and Connected Dominating Sets in Dynamic Graphs

Dominating Sets and Connected Dominating Sets in Dynamic Graphs

Year: 2019
Media group: LIPIcs
Cover von Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces

Year: 2026
Media group: LIPIcs
Cover von Fully Dynamic k-Means Coreset in Near-Optimal Update Time

Fully Dynamic k-Means Coreset in Near-Optimal Update Time

Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0