Titlebook: WALCOM: Algorithms and Computation; Third International Sandip Das,Ryuhei Uehara Conference proceedings 2009 Springer-Verlag Berlin Heidel

Colonnade

植物學(xué)

metropolitan

沉思的魚(yú)

Foundations of Exact Roundingor exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived fro

割讓

Collar

Approximating Shortest Paths in Graphslem of weighted directed graphs. In contrast, there has been a growing interest in the area of algorithms for approximate shortest paths leading to many interesting variations of the original problem..In this article, we trace some of the fundamental developments like spanners and distance oracles,

序曲

Engulf

Algorithms for Computing Diffuse Reflection Paths in Polygonss of the path lie on polygonal edges of .. We present three different algorithms for computing diffuse reflection paths from . to . inside .. For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algor

CRAMP

gusher

Shortest Gently Descending Pathsgeneralization of the shortest descending path problem, called the . problem, where a path descends, but not too steeply. The additional constraint to disallow a very steep descent makes the paths more realistic in practice. We give two approximation algorithms (more precisely, FPTASs) to solve the