Results 1  10
of
1,530,589
The Complexity of an Inverse Shortest Paths Problem
 CONTEMPORARY TRENDS IN DISCRETE MATHEMATICS: FROM DIMACS AND DIMATIA TO THE FUTURE
, 1999
"... In this paper we study the complexity of an Inverse Shortest Paths Problem (ISPP). We show that the problem is intractable even in very restricted cases. In particular, we prove that the ISPP is NPcomplete in the planar case. Furthermore, we give a characterization of the class of graphs G d of giv ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper we study the complexity of an Inverse Shortest Paths Problem (ISPP). We show that the problem is intractable even in very restricted cases. In particular, we prove that the ISPP is NPcomplete in the planar case. Furthermore, we give a characterization of the class of graphs G d
The Inverse Shortest Paths Problem With Upper Bounds on Shortest Paths Costs
, 1997
"... We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NPcomplete. An algorithm for finding a locally optimum solution is proposed, discussed and tested. ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NPcomplete. An algorithm for finding a locally optimum solution is proposed, discussed and tested.
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
, 2008
"... ..."
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
Inverse Acoustic and Electromagnetic Scattering Theory, Second Edition
, 1998
"... Abstract. This paper is a survey of the inverse scattering problem for timeharmonic acoustic and electromagnetic waves at fixed frequency. We begin by a discussion of “weak scattering ” and Newtontype methods for solving the inverse scattering problem for acoustic waves, including a brief discussi ..."
Abstract

Cited by 1072 (45 self)
 Add to MetaCart
Abstract. This paper is a survey of the inverse scattering problem for timeharmonic acoustic and electromagnetic waves at fixed frequency. We begin by a discussion of “weak scattering ” and Newtontype methods for solving the inverse scattering problem for acoustic waves, including a brief
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Results 1  10
of
1,530,589