Sciweavers

796 search results - page 12 / 160
» Approximating the centroid is hard
Sort
View
PERCOM
2006
ACM
14 years 1 months ago
Hardness and approximation of Gathering in static radio networks
Jean-Claude Bermond, Nelson Morales, Stépha...
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Hardness and Approximation of Octilinear Steiner Trees
Matthias Müller-Hannemann, Anna Schulze
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 27 days ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
COCOON
2003
Springer
14 years 23 days ago
Tetris is Hard, Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
Erik D. Demaine, Susan Hohenberger, David Liben-No...
ICALP
2003
Springer
14 years 22 days ago
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities
Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Ko...