Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029494882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing multiple parameters for support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the diameter of a set of points in the Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Covering Sphere Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest enclosing ball of balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient, exact, and generic quadratic programming solver for geometric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768379 / 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: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methodologies for the smallest enclosing circle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm-Start Strategies in Interior-Point Methods for Linear Programming / rank
 
Normal rank

Latest revision as of 13:45, 10 June 2024

scientific article; zbMATH DE number 2192071
Language Label Description Also known as
English
Approximate minimum enclosing balls in high dimensions using core-sets
scientific article; zbMATH DE number 2192071

    Statements

    Approximate minimum enclosing balls in high dimensions using core-sets (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2005
    0 references
    algorithms
    0 references
    core sets
    0 references
    minimum enclosing ball
    0 references
    second-order cone programming
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers

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