Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem (Q968187): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.12.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027225546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding of Polytopes in the Real Number Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-volume enclosing ellipsoids and core sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum-volume enclosing axis-aligned ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Minimum-Volume Covering Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids / rank
 
Normal rank

Latest revision as of 19:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
scientific article

    Statements

    Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem (English)
    0 references
    5 May 2010
    0 references
    0 references
    minimum volume ellipsoids
    0 references
    axis-aligned ellipsoids
    0 references
    core sets
    0 references
    approximation algorithms
    0 references
    complexity analysis
    0 references
    0 references
    0 references
    0 references