• Publications
  • Influence
On the complexity of optimal K-anonymity
TLDR
It is proved that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number of entries to delete from the relation. Expand
Local Search Heuristics for k-Median and Facility Location Problems
TLDR
This work analyzes local search heuristics for the metric k-median and facility location problems and shows that local search with swaps has a locality gap of 5 and introduces a new local search operation which opens one or more copies of a facility and drops zero or more facilities. Expand
Local search heuristic for k-median and facility location problems
TLDR
This paper analyzes local search heuristics for the k-median and facility location problems and proves that without this stretch, the problem becomes NP-Hard to approximate. Expand
Streaming-data algorithms for high-quality clustering
TLDR
This work describes a streaming algorithm that effectively clusters large data streams and provides empirical evidence of the algorithm's performance on synthetic and real data streams. Expand
Clustering Data Streams: Theory and Practice
TLDR
This work describes a streaming algorithm that effectively clusters large data streams and provides empirical evidence of the algorithm's performance on synthetic and real data streams. Expand
Online facility location
  • A. Meyerson
  • Computer Science
  • Proceedings IEEE International Conference on…
  • 14 October 2001
We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these points. We provide a randomized onlineExpand
Auction-Based Multi-Robot Routing
TLDR
A generic framework for auction-based multi-robot routing is suggested and auction methods are shown to offer theoretical guarantees for such a variety of bidding rules and team objectives. Expand
Approximation algorithms for orienteering and discounted-reward TSP
In this paper, we give the first constant-factor approximation algorithm for the rooted orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivated by robotExpand
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
TLDR
A constant-factor approximation is developed for a generalization of the orienteering problem in which both the start and the end nodes of the path are fixed, improving on the previously best known 4-approximation of [6]. Expand
Proportional Fair Frequency-Domain Packet Scheduling for 3GPP LTE Uplink
TLDR
This paper explores the fundamental problem of LTE SC-FDMA uplink scheduling by adopting the conventional time-domain proportional fair algorithm to maximize its objective (i.e. proportional fair criteria) in the frequency-domain setting and presents a set of practical algorithms fine tuned to this problem. Expand
...
1
2
3
4
5
...