7930 search results - page 261 / 1586 » Greedy in Approximation Algorithms |
140
click to vote
ISAAC
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
183
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
180
click to vote
MOBICOM
2006
ACM
16 years 16 days ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
