Login / Signup

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.

Ovidiu DaescuJoseph S. B. MitchellSimeon C. NtafosJames D. PalmerChee-Keng Yap
Published in: SCG (2006)
Keyphrases
  • minimum cost
  • approximation algorithms
  • computational complexity
  • np hard
  • multi objective
  • mobile robot
  • distance function
  • finite number