152 search results - page 11 / 31 » Tetris is Hard, Even to Approximate |
COCOON
2011
Springer
12 years 7 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....