Base-object location problems for base-monotone regions
From MaRDI portal
Recommendations
- Base Location Problems for Base-Monotone Regions
- On maximum weight objects decomposable into based rectilinear convex objects
- EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
- scientific article; zbMATH DE number 871905
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A unified approach to visibility representations of planar graphs
- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
- An \(O(n ^{3} \log\log n/\log ^{2} n)\) time algorithm for all pairs shortest paths
- Compact visibility representation of plane graphs
- EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
- Efficient bounds for the stable set, vertex cover and set packing problems
- Efficient graph-based image segmentation
- Maximum weight digital regions decomposable into digital star-shaped regions
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Some simplified NP-complete graph problems
Cited in
(2)
This page was built for publication: Base-object location problems for base-monotone regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744059)