Results 1  10
of
178,723
A Recursive Greedy Algorithm for Walks in Directed Graphs
 PROC. OF IEEE FOCS
, 2005
"... Given an arcweighted directed graph G = (V, A, ℓ) and a pair of nodes s, t, we seek to find an st walk of length at most B that maximizes some given function f of the set of nodes visited by the walk. The simplest case is when we seek to maximize the number of nodes visited: this is called the ori ..."
Abstract

Cited by 57 (3 self)
 Add to MetaCart
Given an arcweighted directed graph G = (V, A, ℓ) and a pair of nodes s, t, we seek to find an st walk of length at most B that maximizes some given function f of the set of nodes visited by the walk. The simplest case is when we seek to maximize the number of nodes visited: this is called
Improved Algorithms for Orienteering and Related Problems
, 2007
"... In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to pointorienteeringproblem is the following: Given an edgeweighted graph G = (V, E) (directed or undirected), two nodes s, t ∈ V and a budget B, find an st ..."
Abstract

Cited by 53 (5 self)
 Add to MetaCart
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to pointorienteeringproblem is the following: Given an edgeweighted graph G = (V, E) (directed or undirected), two nodes s, t ∈ V and a budget B, find an st
The Minimum Reload st Path/Trail/Walk Problems
"... Abstract. This paper deals with problems on nonoriented edgecolored graphs. The aim is to find a route between two given vertices s and t. This route can be a walk, a trail or a path. Each time a vertex is crossed by a walk there is an associated nonnegative reload cost ri,j, wherei and j denote, ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. This paper deals with problems on nonoriented edgecolored graphs. The aim is to find a route between two given vertices s and t. This route can be a walk, a trail or a path. Each time a vertex is crossed by a walk there is an associated nonnegative reload cost ri,j, wherei and j denote
To Walk and to Be Walked … at the End of the World
"... To be a pilgrim consists of letting the Camino go through you… you are walked by the Camino (pilgrim, fieldnotes 722011) 1.1 Introduction1 To walk … and to be walked; this expression is used by many pilgrims on the Camino to describe the act of walking as a transformative experience. Walking the C ..."
Abstract
 Add to MetaCart
To be a pilgrim consists of letting the Camino go through you… you are walked by the Camino (pilgrim, fieldnotes 722011) 1.1 Introduction1 To walk … and to be walked; this expression is used by many pilgrims on the Camino to describe the act of walking as a transformative experience. Walking
Results 1  10
of
178,723