THE LARGEST EMPTY ANNULUS PROBLEM (Q4818587): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Applications of Parametric Searching in Geometric Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The K-dense corridor problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Widest empty L-shaped corridor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of an Obnoxious Route / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the smallest \(k\)-enclosing circle and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fitting a set of points by a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Geometry in C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circular separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by circles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing largest empty circles with location constraints / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195903001207 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105525115 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article; zbMATH DE number 2104288
Language Label Description Also known as
English
THE LARGEST EMPTY ANNULUS PROBLEM
scientific article; zbMATH DE number 2104288

    Statements

    Identifiers

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