In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank...
Abstract. In this paper we study the metric spaces that are definable in a polynomially bounded ominimal structure. We prove that the family of metric spaces definable in a given p...
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the compari...
Mikhail Sheremet, Frank Wolter, Michael Zakharyasc...
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...