395 search results - page 26 / 79 » Positive Versions of Polynomial Time |
206
click to vote
MLDM
2010
Springer
15 years 18 days ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
170
click to vote
FOCS
2009
IEEE
16 years 17 days ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
204
click to vote
ALGOSENSORS
2009
Springer
16 years 13 days ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
187
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
127
click to vote
CCA
2009
Springer
16 years 12 days ago
2009
Springer
We exhibit a polynomial time computable plane curve Γ that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For...