An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

https://doi.org/10.1016/0020-0190(92)90216-IGet rights and content

Abstract

In this paper, we introduce an O(n) time algorithm to solve the maximum weight independent set problem on an interval graph with n vertices given its interval representation with sorted endpoints list. Based on this linear algorithm, we design an O(n2) time algorithm using O(n2) space to solve the maximum weight 2-independent set problem on an interval graph with n vertices. With a slight extension and modification of our algorithm, the maximum weight k-independent set problem on an interval graph with n vertices can be solved in O(nk) time using O(nk) space.

References (11)

There are more references available in the full text version of this article.

Cited by (80)

  • Packing boundary-anchored rectangles and squares

    2020, Computational Geometry: Theory and Applications
  • Managing platelet supply through improved routing of blood collection vehicles

    2018, Computers and Operations Research
    Citation Excerpt :

    We calculate the maximum amount that can be collected from a donation site by a single vehicle by finding a Maximum Weight Independent Set on an interval graph. Maximum weight independent set can be found in polynomial time (O(nlogn)) for interval graphs (Hsiao et al., 1992). We show that solving the single vehicle-single donation site version of MBCP is equivalent to finding a maximum weight independent set on an interval graph.

  • Generalizing Downsampling from Regular Data to Graphs

    2023, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023
View all citing articles on Scopus
View full text