334 search results - page 3 / 67 » Efficient Algorithms for the Tree Homeomorphism Problem |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...
ALGORITHMICA
2008
13 years 5 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
VLSID
2002
IEEE
14 years 5 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
AMAI
2008
Springer
13 years 5 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...