3874 search results - page 142 / 775 » Approximation Algorithms for k-hurdle Problems |
130
click to vote
ECCC
2011
14 years 8 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
114
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
118
Voted
ALGORITHMICA
2005
15 years 1 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
102
click to vote
DIS
2007
Springer
15 years 8 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
130
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...