In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Must...
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...