Publications related to Shortest path problem

Network design of a transport system based on accelerating moving walkways

Michel Bierlaire, Riccardo Scarinci, Iliya Dimitrov Markov

Pollution, congestion and urbanistic considerations are leading to a change in the use of private vehicles in dense city centers. More frequently, the last-mile is covered with systems such as public transport, car sharing and bike sharing as well as an in ...

2017

Network design of a transport system based on accelerating moving walkways

Michel Bierlaire, Riccardo Scarinci, Iliya Dimitrov Markov

Pergamon-Elsevier Science Ltd2017

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases, including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little attention by c ...

Association for Computing Machinery2017

Learning the weight matrix for sparsity averaging in compressive imaging

Jean-Philippe Thiran, Dimitris Perdios, Adrien Georges Jean Besson

We propose to map the fast iterative shrinkage-thresholding algorithm to a deep neural network (DNN), with a sparsity prior in a concatenation of wavelet bases, in the context of compressive imaging. We exploit the DNN architecture to learn the optimal wei ...

2017

Constant Factor Approximation for ATSP with Two Edge Weights

Ola Nils Anders Svensson, Jakub Tarnawski

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...

Springer Int Publishing Ag2016

An affected core drives network integration deficits of the structural connectome in 22q11.2 deletion syndrome

Alessandra Griffa, Patric Hagmann, Marie Schaer, Frantisek Vasa

Chromosome 22q11.2 deletion syndrome (22q11DS) is a genetic disease known to lead to cerebral structural alterations, which we study using the framework of the macroscopic white-matter connectome. We create weighted connectomes of 44 patients with 22q11DS ...

Elsevier Sci Ltd2016

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Vertex-Frequency Analysis on Graphs

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs. To do so, we need to account for the intrinsic geometric structure of the ...

Academic Press Inc Elsevier Science2016

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Shortest path problem

Network design of a transport system based on accelerating moving walkways

Network design of a transport system based on accelerating moving walkways

Maximizing Symmetric Submodular Functions

Indiscreet discrete logarithms

Learning the weight matrix for sparsity averaging in compressive imaging

Constant Factor Approximation for ATSP with Two Edge Weights

An affected core drives network integration deficits of the structural connectome in 22q11.2 deletion syndrome

Space lower bounds for low-stretch greedy embeddings

Multiphysics Computational Modeling in C-Heart

Vertex-Frequency Analysis on Graphs

Graph Chatbot

Chat with Graph Search

Network design of a transport system based on accelerating moving walkways

Network design of a transport system based on accelerating moving walkways

Learning the weight matrix for sparsity averaging in compressive imaging

Indiscreet discrete logarithms

Vertex-Frequency Analysis on Graphs

An affected core drives network integration deficits of the structural connectome in 22q11.2 deletion syndrome

Multiphysics Computational Modeling in C-Heart

Space lower bounds for low-stretch greedy embeddings

Maximizing Symmetric Submodular Functions

Constant Factor Approximation for ATSP with Two Edge Weights