Minimum Clique Partition Problem with Constrained Weight for Interval Graphs
From MaRDI portal
Recommendations
- Some approximation algorithms for the clique partition problem in weighted interval graphs
- On the clique partitioning problem in weighted interval graphs
- On the minimum clique partitioning problem on weighted chordal graphs
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- The maximum clique problem in multiple interval graphs
Cited in
(10)- Two-way and multiway partitioning of a set of intervals for clique-width maximization
- Consecutive interval query and dynamic programming on intervals
- On the minimum clique partitioning problem on weighted chordal graphs
- Clique partitioning of interval graphs with submodular costs on the cliques
- scientific article; zbMATH DE number 1354129 (Why is no real title available?)
- RESTRICTED TRACK ASSIGNMENT WITH APPLICATIONS
- Minimum nonuniform graph partitioning with unrelated weights
- On the approximability of the minimum weight t-partite clique problem
- On the clique partitioning problem in weighted interval graphs
- Some approximation algorithms for the clique partition problem in weighted interval graphs
This page was built for publication: Minimum Clique Partition Problem with Constrained Weight for Interval Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591329)
