503 search results - page 39 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
133
Voted
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
127
Voted
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
174
Voted
ICDCS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
122
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
136
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...