Abstract
In this brief note we present a correction of the Propositions 1 and 5 for proving the O(n) complexity of the algorithms described in [Dietrich et al. (1993)] for identifying maximal cliques and non-dominated covers from extensions of consecutive minimal covers and alternates implied by 0–1 knapsack constraints.
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.
