scientific article; zbMATH DE number 7053269
From MaRDI portal
Publication:5743388
zbMath1421.68196MaRDI QIDQ5743388
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095133
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (4)
A general approximation method for bicriteria minimization problems ⋮ Approximating the restricted 1-center in graphs ⋮ Finding cheapest deadline paths ⋮ Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs
Cites Work
- Unnamed Item
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Approximate distance oracles
- Spanners and emulators with sublinear distance errors
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- A dual algorithm for the constrained shortest path problem
- Approximation Schemes for the Restricted Shortest Path Problem
- Multiconstrained QoS Routing: A Norm Approach
- Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time
- A simple efficient approximation scheme for the restricted shortest path problem
This page was built for publication:
