361 search results - page 26 / 73 » Relaxed Gabriel Graphs |
104
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
168
Voted
GG
2010
Springer
15 years 2 months ago
2010
Springer
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
140
click to vote
WADS
1993
Springer
15 years 5 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
130
click to vote
ECCC
2000
15 years 1 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
105
click to vote
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...