7129 search results - page 997 / 1426 » Approximation Algorithms for Treewidth |
163
click to vote
CCCG
2010
15 years 6 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
141
click to vote
CATS
2007
15 years 6 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
153
click to vote
COLOGNETWENTE
2008
15 years 6 months ago
2008
Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
137
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
120
click to vote
DAGSTUHL
2008
15 years 6 months ago
2008
The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric al...