最重要的环节障碍
Most vital segment barriers
摘要:
我们研究连续的类似物的“生命力”的离散网络流/路径,并考虑相关的问题,将部分障碍,具有最高的影响流/路径在多边形域。这将流/路径的“最重要弧”的图论概念扩展到几何环境。我们给硬度的结果和有效的算法的各种版本的问题,(几乎)完全分离硬和多项式可解的情况下。
英文摘要:
We study continuous analogues of "vitality" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a polygonal domain. This extends the graph-theoretic notion of "most vital arcs" for flows/paths to geometric environments. We give hardness results and efficient algorithms for various versions of the problem, (almost) completely separating hard and polynomially-solvable cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。