Sciweavers

3192 search results - page 67 / 639
» The minimum latency problem
Sort
View
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
14 years 10 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 10 months ago
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
Serge Gaspers, Mathieu Liedloff
JGT
2010
127views more  JGT 2010»
14 years 8 months ago
On the minimum degree of minimal Ramsey graphs
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
Tibor Szabó, Philipp Zumstein, Stefanie Z&u...
ECML
2006
Springer
15 years 1 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
CAD
2011
Springer
14 years 5 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...