The following pages link to The dense \(k\)-subgraph problem (Q5930156):
Displayed 50 items.
- Optimal matroid partitioning problems (Q2032344) (← links)
- On the complexity and approximability of repair position selection problem (Q2051902) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- The maximum exposure problem (Q2123293) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- On majorization of closed walk vectors of trees with given degree sequences (Q2335614) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← 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)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms (Q2448193) (← links)
- A note on the set union knapsack problem (Q2449074) (← 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)
- Community detection in dense random networks (Q2510823) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- How bad is forming your own opinion? (Q2516243) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Classical benchmarking of Gaussian boson sampling on the Titan supercomputer (Q2681599) (← 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)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset (Q3467871) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Long Term Memory and the Densest K-Subgraph Problem (Q4993327) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- (Q5136271) (← 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)