For example, this has been shown for the case in which the so-called dependency graph – a structure describing which subsets in the k-partition directly influence each other – is a forest. Though NP-complete in general, several special cases of CPMC have been identified that are solvable in polynomial time and still regularly occur in practice. the problem of finding a k-clique in a k-partite graph with known partition, can be found as a substructure in many real-world applications, in particular from logistics and mobility. The clique problem with multiple-choice constraints (CPMC), i.e. Optimization Online - Algorithms for the Clique Problem with Multiple-Choice Constraints under a Series-Parallel Dependency GraphĪlgorithms for the Clique Problem with Multiple-Choice Constraints under a Series-Parallel Dependency GraphĪndreas Bärmann(andreas.baermann fau.de) Patrick Gemander(patrick.gemander fau.de) Maximilian Merkert(rkert ) Ann-Kathrin Wiertz(ann-kathrin.wiertz fau.de) Francisco Javier Zaragoza Martínez(franz )
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |