690 search results - page 20 / 138 » Dense Admissible Sets |
COMBINATORICS
2007
13 years 7 months ago
2007
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...
DCG
2010
13 years 7 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
IRI
2006
IEEE
14 years 1 months ago
2006
IEEE
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
DAGSTUHL
2008
13 years 8 months ago
2008
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...