Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1161.68814OpenAlexW3010016474MaRDI QIDQ5394261FDOQ5394261

Authors: Ovidiu Daescu, Joseph S. B. Mitchell, James Dean Palmer, Simeon C. Ntafos, Chee K. Yap 

Publication date: 25 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11534273

Recommendations

• On the k Shortest Simple Paths Problem in Weighted Directed Graphs
• On the \(k\)-simple shortest paths problem in weighted directed graphs
• An experimental study of weighted \(k\)-link shortest path algorithms
• Approximate shortest paths in weighted graphs
• scientific article; zbMATH DE number 1817738
• Near-shortest and K-shortest simple paths
• Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
• Publication:4886072
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (7)

• Title not available (Why is that?)
• On time-optimal trajectories in non-uniform mediums
• Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
• On the k Shortest Simple Paths Problem in Weighted Directed Graphs
• An experimental study of weighted \(k\)-link shortest path algorithms
• Title not available (Why is that?)
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications

This page was built for publication: Algorithms and Data Structures

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