Hitting sets online and unique-MAX coloring (Q741535): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Online Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles / 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: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting sets when the VC-dimension is small / 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: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering rectilinear polygons with axis-parallel rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational models and task scheduling for parallel sparse Cholesky factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph partition problem with application to VLSI layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: On neighbors in geometric permutations. / rank
 
Normal rank

Latest revision as of 01:41, 9 July 2024

scientific article
Language Label Description Also known as
English
Hitting sets online and unique-MAX coloring
scientific article

    Statements

    Hitting sets online and unique-MAX coloring (English)
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    online algorithms
    0 references
    hitting set problem
    0 references
    set cover problem
    0 references
    transversals
    0 references
    vertex ranking
    0 references
    unique MAX-coloring
    0 references

    Identifiers

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