Abstract
Given a connected weighted graph G = (V,E), we consider a hypergraph HG = (V, PG) corresponding to the set of all shortest paths in G. For a given real assignment a on V satisfying 0≤a(v)≤1, a global rounding α with respect to HG is a binary assignment satisfying that |Σv∈Fa(v)-α(v)| <1 for every F ∈ PG. We conjecture that there are at most |V| + 1 global roundings for HG, and also the set of global roundings is an affine independent set. We give several positive evidences for the conjecture.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.