Pages that link to "Item:Q1926502"
From MaRDI portal
The following pages link to Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (Q1926502):
Displaying 4 items.
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number (Q1799389) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- (Q3748301) (← links)