Refined algorithms for hitting many intervals (Q344570): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2016.11.001
@@ Property / DOI: 10.1016/j.ipl.2016.11.001 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R05
@@ Property / Mathematics Subject Classification ID: 68R05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W40
@@ Property / Mathematics Subject Classification ID: 68W40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6655358
@@ Property / zbMATH DE Number: 6655358 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+analysis of algorithms
@@ Property / zbMATH Keywords: analysis of algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling with gaps
@@ Property / zbMATH Keywords: scheduling with gaps / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hitting set
@@ Property / zbMATH Keywords: hitting set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+interval graph
@@ Property / zbMATH Keywords: interval graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dynamic programming
@@ Property / zbMATH Keywords: dynamic programming / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2016.11.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2551385346
@@ Property / OpenAlex ID: W2551385346 / rank @@
+Normal rank
@@ Property / cites work @@
+An almost optimal algorithm for unbounded searching
+Normal rank
@@ Property / cites work @@
+On the \(k\)-coloring of intervals
@@ Property / cites work: On the \(k\)-coloring of intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with Gaps: New Models and Algorithms
@@ Property / cites work: Scheduling with Gaps: New Models and Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Partial Interval Set Cover – Trade-Offs between Scalability and Optimality
+Normal rank
@@ Property / cites work @@
+Covering Analysis of the Greedy Algorithm for Partial Cover
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Algorithms for maximumk-colorings andk-coverings of transitive graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms on circular-arc graphs
@@ Property / cites work: Linear time algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Upper Bounds for Partial Vertex Cover
@@ Property / cites work: Improved Upper Bounds for Partial Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for approximate string matching
@@ Property / cites work: Algorithms for approximate string matching / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2016.11.001
@@ Property / DOI: 10.1016/J.IPL.2016.11.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:344570