Understanding the effectiveness of data reduction in public transportation networks
From MaRDI portal
(Redirected from Publication:6154913)
Abstract: 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.
Recommendations
- Algorithms – ESA 2004
- Experiments on data reduction for optimal domination in networks
- A computational study of reduction techniques for the minimum connectivity inference problem
- Effective and efficient data reduction for the subset interconnection design problem
- Efficient algorithms to find optimal paths in a public transportation network
Cited in
(2)
This page was built for publication: Understanding the effectiveness of data reduction in public transportation networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154913)
