arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.12477cs.SIcs.DS
收藏

了解公共交通网络中数据简化的有效性

Understanding the Effectiveness of Data Reduction in Public Transportation Networks

Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck

摘要:

给定一个公共交通网络的车站和连接,我们希望找到一个最小的车站子集,使每个连接运行通过一个选定的车站。虽然这个问题通常是NP难的,但现实世界的实例通常几乎完全由一组简单的约简规则解决。为了解释这种行为,我们认为交通网络的命中集实例,并确定两个特征属性,局部性和异质性。然后,我们设计了一个随机化模型来生成具有可调属性的命中集实例。虽然异构性确实影响约简规则的有效性,但生成的实例表明,局部性是重要因素。除此之外,我们证明了减少规则的有效性是独立的底层图结构。最后,我们表明,高局部性也普遍存在于其他领域的实例中,便于快速计算最小命中集。

英文摘要:

Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although this problem is NP-hard in general, real-world instances are regularly solved almost completely by a set of simple reduction rules. To explain this behavior, we view transportation networks as hitting set instances and identify two characteristic properties, locality and heterogeneity. We then devise a randomized model to generate hitting set instances with adjustable properties. While the heterogeneity does influence the effectiveness of the reduction rules, the generated instances show that locality is the significant factor. Beyond that, we prove that the effectiveness of the reduction rules is independent of the underlying graph structure. Finally, we show that high locality is also prevalent in instances from other domains, facilitating a fast computation of minimum hitting sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑