• Home
  • Search
  • Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm
  • Cite Icon6
  • https://doi.org/10.3390/math11092000Copy DOI Icon

Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Estimating covering functionals of convex bodies is an important part of Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a long-standing open problem from convex and discrete geometry. In this paper, we transform this problem into a vertex p-center problem (VPCP). An exact iterative algorithm is introduced to solve the VPCP by making adjustments to the relaxation-based algorithm mentioned by Chen and Chen in 2009. The accuracy of this algorithm is tested by comparing numerical and exact values of covering functionals of convex bodies including the Euclidean disc, simplices, and the regular octahedron. A better lower bound of the covering functional with respect to 7 of 3-simplices is presented.

Loading PDF

Similar Papers
  • PDF
  • Research Article
  • Citations41

A scalable exact algorithm for the vertex p-center problem

  • Nov 20, 2018
  • Computers & Operations Research
  • Claudio Contardo +2
  • Research Article

Construction of ε-Nets for the Space of Planar Convex Bodies Endowed with the Banach–Mazur Metric

  • Apr 21, 2025
  • Mathematics
  • Yanmei Chen +3
  • Book Chapter
  • Citations16

Combinatorial Integral Geometry, Metrics, and Zonoids

  • Jan 01, 1987
  • R. V. Ambartzumian
  • Research Article
  • Citations78

Algorithms for three-dimensional rigidity analysis and a first-order percolation transition

  • Oct 25, 2007
  • Physical Review E
  • M V Chubynsky +1
  • Research Article
  • Citations5

Strange phenomena in convex and discrete geometry

  • May 01, 1997
  • Choice Reviews Online
  • Research Article
  • Citations10

Covering a set with homothets of a convex body

  • Mar 07, 2009
  • Positivity
  • Márton Naszódi
  • Conference Instance
  • Citations12

Near-Optimal Generalisations of a Theorem of Macbeath

  • Mar 01, 2014
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Nabil H Mustafa +1
  • Research Article
  • Citations8

EIA-CNDP: An exact iterative algorithm for critical node detection problem

  • Nov 26, 2020
  • Computers & Operations Research
  • Javad Rezaei +3
  • Research Article
  • Citations9

On the covering index of convex bodies

  • Feb 17, 2016
  • Aequationes mathematicae
  • Károly Bezdek +1
  • Research Article

SOME PROBLEMS ON DISCRETE GEOMETRY AND COMBINATORICS

  • Jan 01, 2012
  • Rutgers University Community Repository (Rutgers University)
  • Lei Wang
  • Single Book
  • Citations47

Polyhedral and Algebraic Methods in Computational Geometry

  • Jan 01, 2013
  • Michael Joswig +1
  • Research Article
  • Citations21

Continuity of the maximum-entropy inference: Convex geometry and numerical ranges approach

  • Aug 10, 2015
  • Journal of Mathematical Physics
  • Leiba Rodman +3
  • Research Article
  • Citations9

BOT3P—Bologna Transport Analysis Pre-Post-Processors Version 3.0

  • Feb 01, 2004
  • Nuclear Science and Engineering
  • Roberto Orsi
  • Research Article

Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm

  • Feb 01, 2018
  • Journal of Optimization in Industrial Engineering
  • J Behnamian
  • PDF
  • Research Article
  • Citations13

Covering Lattice Points by Subspaces and Counting Point–Hyperplane Incidences

  • Feb 09, 2018
  • Discrete & Computational Geometry
  • Martin Balko +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.