AI Chat AI Image Generator AI Video Text to Speech

Reverse Greedy is Bad for k-Center

10/03/2018
∙
by   D. Ellis Hershkowitz, et al.
∙
0
∙

We demonstrate that the reverse greedy algorithm is a Θ(k) approximation for k-center.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 11/07/2022

A Simple Combinatorial Algorithm for Robust Matroid Center

Recent progress on robust clustering led to constant-factor approximatio...
0 Georg Anegg, et al. ∙
research
∙ 08/19/2023

Laminar Matroid Secretary: Greedy Strikes Back

We show that a simple greedy algorithm is 4.75 probability-competitive f...
0 Zhiyi Huang, et al. ∙
research
∙ 05/26/2021

Implementation of Live Reverse Debugging in LLDB

Debugging is an essential process with a large share of the development ...
0 Anthony Savidis, et al. ∙
research
∙ 12/02/2019

Noisy, Greedy and Not So Greedy k-means++

The k-means++ algorithm due to Arthur and Vassilvitskii has become the m...
0 Anup Bhattacharya, et al. ∙
research
∙ 07/23/2020

Two-way Greedy: Algorithms for Imperfect Rationality

The realization that selfish interests need to be accounted for in the d...
0 Diodato Ferraioli, et al. ∙
research
∙ 02/27/2023

On the Connection between Greedy Algorithms and Imperfect Rationality

The design of algorithms or protocols that are able to align the goals o...
0 Diodato Ferraioli, et al. ∙
research
∙ 09/14/2017

Parallel Enumeration of Triangulations

We report on the implementation of an algorithm for computing the set of...
0 Charles Jordan, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal