503 search results - page 12 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
88
Voted
NAA
2000
Springer
15 years 3 months ago
2000
Springer
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
109
click to vote
JCO
2008
14 years 11 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
120
Voted
ALGORITHMICA
2008
14 years 11 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
110
Voted
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
78
Voted
AMC
2006
14 years 11 months ago
2006
In this paper, given a balance scale and the information that there are exactly two different defective coins present, the authors consider the problem of ascertaining the minimum...