53 search results - page 5 / 11 » latin 2010 |
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
LATIN
2010
Springer
14 years 21 days ago
2010
Springer
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...