Pages that link to "Item:Q3020016"
From MaRDI portal
The following pages link to Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016):
Displayed 24 items.
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- A note on a maximum \(k\)-subset intersection problem (Q436571) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- On an ordering problem in weighted hypergraphs (Q2115861) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Adversarial topology discovery in network virtualization environments: a threat for ISPs? (Q2353249) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- \(d\)-dimensional arrangement revisited (Q2444745) (← 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)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Mining Compressing Sequential Patterns (Q4969924) (← links)
- (Q4993268) (← links)
- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges (Q5041192) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
- (Q5214187) (← links)