Grasp and delivery for moving objects on broken lines

DOI10.1007/s00224-007-9081-yzbMath1136.68056OpenAlexW2006554361MaRDI QIDQ2481562

Shinichi Shimoirisa, Yuichi Asahiro, Eiji Miyano

Publication date: 11 April 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9081-y

zbMATH Keywords

Approximation algorithmGrasp and deliveryMAXSNP-hardnessMoving objects

Mathematics Subject Classification ID

Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Related Items (1)

Vehicle Routing Algorithms for Radially Escaping Targets

Uses Software

• VRP

Cites Work

• How to collect balls moving in the Euclidean plane
• Approximation results for kinetic variants of TSP
• On the approximability of an interval scheduling problem
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Theoretical Computer Science
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Grasp and delivery for moving objects on broken lines