ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio o...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...