scientific article; zbMATH DE number 1507215

MaRDI QIDQ4503935zbMATH OpenFDO

Authors Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela

Publication date 28 November 2001

zbMATH Keywords

approximation algorithmgraph search problemminimum latency problemtravelling repairman problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2079396
• Approximation schemes for minimum latency problems
• LATIN 2004: Theoretical Informatics
• Approximation Schemes for Minimum Latency Problems
• The \(k\)-traveling repairmen problem

Cited in

(19)

• A new formulation for the traveling deliveryman problem
• Approximation and complexity of multi-target graph search and the Canadian traveler problem
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• The expanding search ratio of a graph
• A simple and effective metaheuristic for the minimum latency problem
• Solving the traveling delivery person problem with limited computational time
• Online routing and searching on graphs with blocked edges
• Competitive search in a network
• A search theory model of patch-to-patch forager movement with application to pollinator-mediated gene flow
• The risk-averse traveling repairman problem with profits
• Optimal deterministic algorithms for some variants of online quota traveling salesman problem
• How traveling salespersons prove their identity
• Exact and Approximation Algorithms for the Expanding Search Problem
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• An improved approximation guarantee for prize-collecting TSP
• A guided quantum particle swarm optimization approach for the traveling repairman problem
• A better-than-1.6-approximation for prize-collecting TSP
• A better-than-1.6-approximation for prize-collecting TSP
• The online prize-collecting traveling salesman problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503935)