100 search results - page 8 / 20 » Approximation Algorithms for Geometric Intersection Graphs |
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
LION
2009
Springer
14 years 1 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
BIBE
2008
IEEE
14 years 1 months ago
2008
IEEE
—A new method is introduced for joining vessel segments together to form a vessel graph. Using a reference image set from the Sunderland Eye Infirmary, we analysed the retinal b...
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...