We describe a slightly subexponential time algorithm for learning parity functions in the
presence of random classification noise, a problem closely related to several cryptographic …

The paper presents selected multicriteria (multiobjective) approaches to shortest path
problems. A classification of multiobjective shortest path (MOSP) problems is given. Different …

We consider the problem of finding an obstacle-avoiding path between two points s and t in
the plane, amidst a set of disjoint polygonal obstacles with a total of n vertices. The length of …

Abstract A (1+ ε)–approximate distance oracle for a graph is a data structure that supports
approximate point-to-point shortest-path-distance queries. The most relevant measures for a …

We consider the problem of preprocessing an n-vertex digraph with real edge weights so
that subsequent queries for the shortest path or distance between any two vertices can be …

The problem of processing shortest path queries in graphs arises in application areas such
as intelligent transportation system (ITS), geographic information system (GIS), and robotics …

There are several known data structures that answers distance queries between two
arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space …

Algorithms are presented for the all-pairs min-cut problem in bounded tree-width, planar,
and sparse networks. The approach used is to preprocess the inputn-vertex network so that …

We describe algorithms for finding shortest paths and distances in outerplanar and planar
digraphs that exploit the particular topology of the input graph. An important feature of our …

As the range of applications for Intelligent Transport Systems (ITS) grows wider, the
efficiency of the underlying tools for Big Data Analytics becomes of crucial importance. Smart …