10 search results - page 1 / 2 » A Robust and Fast Algorithm for Computing Exact and Approxim... |
ICCSA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
COR
2004
13 years 4 months ago
2004
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
TON
2008
13 years 4 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...