Two-phase algorithms for the parametric shortest path problem

Details Two-phase algorithms for the parametric shortest path problem Two-phase algorithms for the parametric shortest path problem

2010-01-21

arxiv.org/abs/1001.3749v2

Computer Science

Computational Complexity

Scientific paper

A {\em parametric weighted graph} is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obtains a standard edge-weighted graph. Parametric weighted graph problems are generalizations of weighted graph problems, and arise in various natural scenarios. Parametric weighted graph algorithms consist of two phases. A {\em preprocessing phase} whose input is a parametric weighted graph, and whose output is a data structure, the advice, that is later used by the {\em instantiation phase}, where a specific value for the variable is given. The instantiation phase outputs the solution to the (standard) weighted graph problem that arises from the instantiation. The goal is to have the running time of the instantiation phase supersede the running time of any algorithm that solves the weighted graph problem from scratch, by taking advantage of the advice. In this paper we construct several parametric algorithms for the shortest path problem. For the case of linear function weights we present an algorithm for the single source shortest path problem.

Affiliated with

Also associated with

No associations

Rating

Two-phase algorithms for the parametric shortest path problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two-phase algorithms for the parametric shortest path problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-phase algorithms for the parametric shortest path problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248958