The following pages link to The dense \(k\)-subgraph problem (Q5930156):
Displayed 50 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Chromatic kernel and its applications (Q266072) (← links)
- Sharp spectral bounds of several graph parameters using eigenvector norms (Q286136) (← links)
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Graph clustering (Q458448) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Distributed discovery of large near-cliques (Q661050) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Dense and sparse graph partition (Q714027) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Approximation of the quadratic knapsack problem (Q1694783) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
- Single-machine scheduling with supporting tasks (Q1751119) (← links)
- The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)