Refined algorithms for hitting many intervals
DOI10.1016/J.IPL.2016.11.001zbMATH Open1393.68128OpenAlexW2551385346MaRDI QIDQ344570FDOQ344570
Authors: Peter Damaschke 
Publication date: 23 November 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.11.001
Recommendations
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Cites Work
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- Algorithmic graph theory and perfect graphs
- On the \(k\)-coloring of intervals
- Improved Upper Bounds for Partial Vertex Cover
- Title not available (Why is that?)
- The maximum k-colorable subgraph problem for chordal graphs
- Algorithms for maximumk-colorings andk-coverings of transitive graphs
- An almost optimal algorithm for unbounded searching
- Linear time algorithms on circular-arc graphs
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality
- Scheduling with gaps: new models and algorithms
- Covering analysis of the greedy algorithm for partial cover
- Algorithms for approximate string matching
Cited In (4)
This page was built for publication: Refined algorithms for hitting many intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344570)
