An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
References (11)
- et al.
Solving the single step graph searching problem by solving the maximum two-independent set problem
Inform. Process. Lett.
(1991) The NP-completeness column: An ongoing guide
J. Algorithms
(1985)- et al.
The maximum k-colorable subgraph problem for chordal graphs
Inform. Process. Lett.
(1987) Efficient algorithms for domination problems on interval and circular-arc graphs
Proc. 12th World Computer Congress, Vol. 1: Algorithm, Software, Architecture
(September 1992)- et al.
Computer and Intractability: A Guide to the Theory of NP-Completeness
(1978)
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 ApplicationsScheduling two agents on a single machine: A parameterized analysis of NP-hard problems
2019, Omega (United Kingdom)Managing platelet supply through improved routing of blood collection vehicles
2018, Computers and Operations ResearchCitation 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.
Just-in-time scheduling with two competing agents on unrelated parallel machines
2016, Omega (United Kingdom)Generalizing Downsampling from Regular Data to Graphs
2023, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023
Copyright © 1992 Published by Elsevier B.V.