scientific article; zbMATH DE number 7788350

DOI10.5555/3458064.3458076MaRDI QIDQ6147259zbMATH OpenFDO

Authors

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/1912.10486

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(10)

• On graphs coverable by \({k}\) shortest paths
• Parameterizing path partitions
• Detecting disjoint shortest paths in linear time and more
• Min-sum disjoint paths on subclasses of chordal graphs
• Lower bounds for approximate (\& exact) k-disjoint-shortest-paths
• Min-sum disjoint paths on subclasses of chordal graphs
• Lower bounds for approximate (\& exact) \(k\)-\textsc{Disjoint-Shortest-Paths}
• Tight approximation and kernelization bounds for vertex-disjoint shortest paths
• Using a geometric Lens to find k disjoint shortest paths
• Tight approximation and kernelization bounds for vertex-disjoint shortest paths

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 Q6147259)