Pages that link to "Item:Q4895634"
From MaRDI portal
The following pages link to Approximation Algorithms for the <i>k</i>-Clique Covering Problem (Q4895634):
Displaying 17 items.
- A note on the clustered set covering problem (Q496643) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
- Covering with clubs: complexity and approximability (Q1670995) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- Optimal partial clique edge covering guided by potential energy minimization (Q2329666) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Design of test inputs and their sequences in multi-function system testing (Q2505033) (← links)
- Bin Packing with Colocations (Q2971155) (← links)
- Clique Covering of Graphs IV. Algorithms (Q3340897) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Three perspectives for solving the job grouping problem (Q4443354) (← links)
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
- On approximating the number of k-cliques in sublinear time (Q5230333) (← links)
- Data reduction and exact algorithms for clique cover (Q5406188) (← links)