Abstract
Using graph products we present an O(|V|2|E|+|V|3log|V|) separation algorithm for the nonsimple 1-wheel inequalities by Cheng and Cunningham (1997) of the stable set polytope, which is faster than their O(|V|4) algorithm.There are two ingredients for our algorithm. The main improvement stems from a reduction of the separation problem to multiple shortest path problems in an auxiliary graph having only 6|V| vertices and 9|E| arcs, thereby preserving low sparsity. Then Johnson’s algorithm can be applied to the auxiliary graph of same sparsity as the original one.In contrast, Cheng and Cunningham’s auxiliary graph is by construction dense, |E|=O(|V|2), so application of Johnson’s algorithm provides no large improvement.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
