4843 search results - page 41 / 969 » The Shortcut Problem - Complexity and Approximation |
CCCG
2010
13 years 10 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
IFIP
2005
Springer
14 years 2 months ago
2005
Springer
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
IPL
2007
13 years 8 months ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
ALGORITHMICA
2004
13 years 8 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...