We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...