2023/09/22 by Adriana Ortiz-Aquino, Ortiz-Aquino, Adriana, Nathan Albin +1
Computer Science · Engineering · #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Optimization and Packing Problems #VLSI and FPGA Design Techniques
paper · pdf · doi:10.48550/arxiv.2309.13180
openalex publication_date 2023/09/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper explores the modulus (discrete p-modulus) of the family of edge covers on a discrete graph. This modulus is closely related to that of the larger family of fractional edge covers; the modulus of the latter family is guaranteed to approximate the modulus of the former within a multiplicative factor. The bounds on edge cover modulus can be computed efficiently using a duality result that relates the fractional edge covers to the family of stars.