Biclique completion problems for multicast network design
From MaRDI portal
Publication:2427696
Recommendations
- A branch‐and‐price approach to k‐clustering minimum biclique completion problem
- Problems and invariants connected with bicliques and multicliques of graphs
- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
- Dimensioning multicast-enabled communications networks
- Multicast Routing and Design of Sparse Connectors
Cites work
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079349 (Why is no real title available?)
- scientific article; zbMATH DE number 1898347 (Why is no real title available?)
- Heuristic algorithms for packing of multiple-group multicasting
- Multiple multicast tree allocation in IP network.
- Optimum and multicast of multimedia streams
- The maximum edge biclique problem is NP-complete
Cited in
(8)- On star and biclique edge-colorings
- The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics
- A branch‐and‐price approach to k‐clustering minimum biclique completion problem
- The biclique partitioning polytope
- On solving manufacturing cell formation via bicluster editing
- Semidefinite programming and constraint programming
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- An adaptive neighborhood search for \(k\)-clustering minimum bi-clique completion problems
This page was built for publication: Biclique completion problems for multicast network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2427696)