Pages that link to "Item:Q995565"
From MaRDI portal
The following pages link to Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565):
Displaying 11 items.
- A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125) (← links)
- On the clique partitioning problem in weighted interval graphs (Q924162) (← links)
- Two-way and multiway partitioning of a set of intervals for clique-width maximization (Q1283929) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- On the minimum clique partitioning problem on weighted chordal graphs (Q2272395) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS (Q3173480) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
- Processing an Offline Insertion-Query Sequence with Applications (Q5321704) (← links)
- (Q6068263) (← links)