Skip to main content
SpringerLink
Log in

A correction of the justification of the Dietrich-escudero-garín-pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates

  • Short Communication
  • Published:
Top Aims and scope Submit manuscript

Summary

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Dietrich, B.L., L.F. Escudero, A. Garín, G. Pérez (1993). O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates.TOP 1, 139–160.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Statistics and Operations Research, Universidad Complutense de Madrid, Spain

    S. Muñoz

Authors
  1. S. Muñoz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Muñoz, S. A correction of the justification of the Dietrich-escudero-garín-pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates. Top 3, 161–165 (1995). https://doi.org/10.1007/BF02574809

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02574809

Keywords

Search

Navigation