Some approximation algorithms for the clique partition problem in weighted interval graphs
DOI10.1016/J.TCS.2007.04.030zbMATH Open1144.68045OpenAlexW2019597617MaRDI QIDQ995565FDOQ995565
Authors: Mingxia Chen, Jianbo Li, Jianping Li, Weidong Li, Lusheng Wang 
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.030
Recommendations
- Minimum Clique Partition Problem with Constrained Weight for Interval Graphs
- On the clique partitioning problem in weighted interval graphs
- On the minimum clique partitioning problem on weighted chordal graphs
- The maximum clique problem in multiple interval graphs
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the \(k\)-coloring of intervals
- Title not available (Why is that?)
- Scheduling Interval-Ordered Tasks
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Title not available (Why is that?)
- Interval graphs and maps of DNA
- Restrictions of graph partition problems. I
Cited In (10)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs
- Clique partitioning of interval graphs with submodular costs on the cliques
- Two-way and multiway partitioning of a set of intervals for clique-width maximization
- A parllel algorithm for finding a maximum weight clique of an interval graph
- Processing an offline insertion-query sequence with applications
- On the clique partitioning problem in weighted interval graphs
- On the minimum clique partitioning problem on weighted chordal graphs
- Title not available (Why is that?)
- Processing an Offline Insertion-Query Sequence with Applications
- Minimum Clique Partition Problem with Constrained Weight for Interval Graphs
This page was built for publication: Some approximation algorithms for the clique partition problem in weighted interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995565)
