12519 search results - page 277 / 2504 » Approximation Problems Categories |
180
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
174
click to vote
ADHOCNOW
2008
Springer
16 years 29 days ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
188
click to vote
ESA
2005
Springer
16 years 1 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
158
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
186
click to vote
ECCC
2000
15 years 6 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...