Improved algorithms for path partition and related problems
From MaRDI portal
Publication:408433
DOI10.1016/J.ORL.2011.08.001zbMATH Open1235.90170OpenAlexW2074234480MaRDI QIDQ408433FDOQ408433
Authors: Danny Z. Chen, Haitao Wang 
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.08.001
Recommendations
- Most uniform path partitioning and its use in image processing
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
- Path equipartition in the Chebyshev norm
- \(k\)-path partitions in trees
- Efficient algorithms for some path partitioning problems
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Most uniform path partitioning and its use in image processing
- Title not available (Why is that?)
- Geometric applications of a matrix-searching algorithm
- Improved complexity bounds for location problems on the real line
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
- Clustering on trees
- Max-min partitioning of grid graphs into connected components
- Path equipartition in the Chebyshev norm
- Monge strikes again: Optimal placement of web proxies in the internet
- The shifting algorithm technique for the partitioning of trees
- A Shifting Algorithm for Min-Max Tree Partitioning
- Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
- New algorithms for 1-D facility location and path equipartition problems
- Minimum \(L_k\) path partitioning-an illustration of the Monge property
Cited In (10)
- Minimum \(L_k\) path partitioning-an illustration of the Monge property
- Improvised divide and conquer approach for the LIS problem
- Path partitions and forward-only trellis algorithms
- Path equipartition in the Chebyshev norm
- New algorithms for 1-D facility location and path equipartition problems
- A note on the partitioning shortest path algorithm
- Most uniform path partitioning and its use in image processing
- Path optimization for graph partitioning problems
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem
- New algorithms for facility location problems on the real line
This page was built for publication: Improved algorithms for path partition and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408433)
