Pages that link to "Item:Q3502654"
From MaRDI portal
The following pages link to Inapproximability of Maximum Weighted Edge Biclique and Its Applications (Q3502654):
Displaying 13 items.
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach (Q2060395) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171) (← links)
- (Q5005143) (← links)
- The Bipartite QUBO (Q5050150) (← links)
