Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
From MaRDI portal
Publication:2980919
DOI10.1007/978-3-319-53925-6_25zbMATH Open1485.68321OpenAlexW2588221826MaRDI QIDQ2980919FDOQ2980919
Authors: Toshiki Saitoh, David Kirkpatrick 
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_25
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
- Title not available (Why is that?)
- Algorithmic graph theory and perfect graphs
- Dominating sets in perfect graphs
- Stability in circular arc graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Linear time algorithms on circular-arc graphs
- Independent Sets in Circular-Arc Graphs
- Selection and sorting with limited storage
- Upper bounds for time-space trade-offs in sorting and selection
- Maximum independent set for intervals by divide and conquer with pruning
- Priority queues and sorting for read-only data
- Optimal time-space tradeoff for the 2D convex-hull problem
- Title not available (Why is that?)
- Minimum dominating sets of intervals on lines
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)
