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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An almost optimal algorithm for unbounded searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Gaps: New Models and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Interval Set Cover – Trade-Offs between Scalability and Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Analysis of the Greedy Algorithm for Partial Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximumk-colorings andk-coverings of transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Upper Bounds for Partial Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Revision as of 23:26, 12 July 2024

scientific article
Language Label Description Also known as
English
Refined algorithms for hitting many intervals
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references