The densest k-subhypergraph problem
From MaRDI portal
Recommendations
- The densest \(k\)-subhypergraph problem
- The dense \(k\)-subgraph problem
- Approximating vertex cover in dense hypergraphs
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
Cites work
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Approximating Steiner networks with node-weights
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Approximation algorithms for hypergraph small set expansion and small set vertex expansion
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Dial a ride from k-forest
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- scientific article; zbMATH DE number 7053293 (Why is no real title available?)
- Improved approximation algorithm for Steiner k-Forest with nearly uniform weights
- Minimizing the union: tight approximations for small set bipartite vertex expansion
- New tools for graph coloring
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Public-key cryptography from different assumptions
- Relations between average case complexity and approximation complexity
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- The dense \(k\)-subgraph problem
- The densest \(k\)-subhypergraph problem
Cited in
(25)- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Computing the \(k\) densest subgraphs of a graph
- Approximation algorithm for minimum partial multi-cover under a geometric setting
- Siting renewable power generation assets with combinatorial optimisation
- The maximum exposure problem
- The small set vertex expansion problem
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem
- Sharp detection boundaries on testing dense subhypergraph
- The density maximization problem in graphs
- The densest \(k\)-subhypergraph problem
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- Test dense subgraphs in sparse uniform hypergraph
- PTAS for Densest k-Subgraph in Interval Graphs
- Sum-of-squares lower bounds for densest k-subgraph
- Pattern masking for dictionary matching: theory and practice
- On approximating partial scenario set cover
- Heterogeneous dense subhypergraph detection
- The low-degree hardness of finding large independent sets in sparse random hypergraphs
- Approximation algorithms for two extensions of min-k-union
- On extensions of min-k-union
- Approximations and hardness of covering and packing partially ordered items
- Detection of dense subhypergraphs by low-degree polynomials
- The strongish planted clique hypothesis and its consequences
This page was built for publication: The densest \(k\)-subhypergraph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174693)
