Dispersing facilities on planar segment and circle amidst repulsion (Q6112004): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Applications of Parametric Searching in Geometric Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-width empty square and rectangular annulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of obnoxious facilities location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LARGEST EMPTY ANNULUS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / 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: Improved algorithms for placing undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766841 / rank
 
Normal rank

Revision as of 13:01, 2 August 2024

scientific article; zbMATH DE number 7722897
Language Label Description Also known as
English
Dispersing facilities on planar segment and circle amidst repulsion
scientific article; zbMATH DE number 7722897

    Statements

    Dispersing facilities on planar segment and circle amidst repulsion (English)
    0 references
    0 references
    4 August 2023
    0 references
    26 January 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    obnoxious facility location
    0 references
    parametric search
    0 references
    continuous location
    0 references
    continuous facility location
    0 references
    approximation scheme
    0 references
    segment tree
    0 references
    dynamic programming
    0 references