Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional graphs with smallest eigenvalue -2 and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs, root systems, and elliptic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and Dynamic Algorithms for k-Point Clustering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5513785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 15:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
scientific article

    Statements

    Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (English)
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    0 references
    approximation algorithms
    0 references
    computational geometry
    0 references
    disc graphs
    0 references
    diameter
    0 references
    0 references
    0 references