7 search results - page 2 / 2 » Tight bounds for connecting sites across barriers |
JUCS
2007
13 years 5 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...