Most vital segment barriers

DOI10.1007/978-3-030-24766-9_36MaRDI QIDQ2285111zbMATH OpenOpenAlexFDO

Authors Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals

Publication date 16 January 2020

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

zbMATH Keywords

geodesic distancesimple polygonflows and paths

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Recommendations

• On maximum flows in polyhedral domains
• Euclidean shortest paths in the presence of rectilinear barriers
• Max flow vitality in general and \(st\)-planar graphs
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• Finding the \(k\) most vital elements of an s-t planar directed network

This page was built for publication: Most vital segment barriers

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