Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
From MaRDI portal
Publication:2980919
Recommendations
- A greedy algorithm for interval greedoids
- Computing the greedy spanner in linear space
- Computing the greedy spanner in linear space
- Computing the Greedy Spanner in Near-Quadratic Time
- Computing the greedy spanner in near-quadratic time
- scientific article; zbMATH DE number 4064506
- On space-efficient algorithms for certain NP-complete problems
- Interpolating greedy and reluctant algorithms
- Space-efficient approximations for subset sum
- A framework for computing the greedy spanner
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2111732 (Why is no real title available?)
- Algorithmic graph theory and perfect graphs
- Dominating sets in perfect graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Independent Sets in Circular-Arc Graphs
- Linear time algorithms on circular-arc graphs
- Maximum independent set for intervals by divide and conquer with pruning
- Minimum dominating sets of intervals on lines
- Optimal time-space tradeoff for the 2D convex-hull problem
- Priority queues and sorting for read-only data
- Selection and sorting with limited storage
- Stability in circular arc graphs
- Upper bounds for time-space trade-offs in sorting and selection
This page was built for publication: Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980919)
