Efficient Approximations for the Online Dispersion Problem (Q4634023): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximizing the number of obnoxious facilities to locate within a bounded region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of geometric dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for spreading points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-sum diversity via convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search for Max-Sum Diversification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sphere packing problem in dimension \(24\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Cut A Cake Fairly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispersion in disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Online Algorithms for Multidimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for online bounded space hypercube packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die dichteste Kugellagerung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum dispersion and geometric maximum weight cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental algorithms for facility location and \(k\)-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive ratio for online facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Kepler conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A literature review on circle and sphere packing problems: models and methodologies / 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: A bounded space algorithm for online circle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy vacancy search algorithm for packing equal circles in a square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for placing undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing equal circles in a square: A deterministic global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for circle and other packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining online approximation algorithms for facility dispersion from offline algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Densest Packing of 9 Circles in a Square / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Geometric Extremum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Cut a Cake Fairly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2836306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sphere packing problem in dimension 8 / rank
 
Normal rank

Revision as of 03:33, 19 July 2024

scientific article; zbMATH DE number 7051392
Language Label Description Also known as
English
Efficient Approximations for the Online Dispersion Problem
scientific article; zbMATH DE number 7051392

    Statements

    Efficient Approximations for the Online Dispersion Problem (English)
    0 references
    0 references
    0 references
    0 references
    7 May 2019
    0 references
    geometric optimization
    0 references
    dispersion
    0 references
    packing
    0 references
    online algorithms
    0 references
    competitive ratio
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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