Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (Q2025288): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-020-01762-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3093583216 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.06699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spherical Hellytype theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Helly-type theorems for spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the volume of the union of spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the volume of a union of balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Volume of the intersection of three spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a ball by smaller balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a ball with smaller equal balls in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex relaxations for quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of four polyhedral set containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CVXPY: A Python-Embedded Modeling Language for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the optimal identification of segment neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Changepoint Detection in the Presence of Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal multiple changepoint algorithms for large data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-020-01762-2 / rank
 
Normal rank

Latest revision as of 19:38, 16 December 2024

scientific article
Language Label Description Also known as
English
Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
scientific article

    Statements

    Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (English)
    0 references
    0 references
    11 May 2021
    0 references
    ball covering problem
    0 references
    nonconvex quadratically constrained quadratic programming
    0 references
    computational geometry
    0 references
    Voronoi-like polyhedron
    0 references
    vertex enumeration
    0 references
    polynomial time complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers

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