Online unit clustering: Variations on a theme (Q954982): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095128928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing of Temporary Tasks on Identical Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for on-line bin-packing problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Algorithm for Online Unit Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Clustering and Dynamic Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing problems with rejection penalties and their dual problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing with Rejection Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Packing with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Coloring with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Online Unit Clustering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated vertex covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Online Unit Clustering / rank
 
Normal rank

Latest revision as of 19:32, 28 June 2024

scientific article
Language Label Description Also known as
English
Online unit clustering: Variations on a theme
scientific article

    Statements

    Online unit clustering: Variations on a theme (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    online algorithms
    0 references
    clustering
    0 references
    coloring
    0 references

    Identifiers