The following pages link to The dense \(k\)-subgraph problem (Q5930156):
Displayed 47 items.
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← 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)
- 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)
- 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)
- 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)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- Sequential vector packing (Q2378514) (← links)
- Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- A ``maximum node clustering'' problem (Q2479564) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- Combinatorial properties and further facets of maximum edge subgraph polytopes (Q2840727) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- An Efficient Algorithm for Enumerating Pseudo Cliques (Q5387774) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)
- Mining relevant information on the Web: a clique-based approach (Q5444416) (← links)
- Finding a Dense-Core in Jellyfish Graphs (Q5458298) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs (Q5900474) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
- Maximum dispersion problem in dense graphs (Q5929139) (← links)