The following pages link to Greedily Finding a Dense Subgraph (Q4943076):
Displaying 45 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)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Multi-way set enumeration in weight tensors (Q413829) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Improved approximation algorithms for maximum graph partitioning problems (Q813332) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- The inverse protein folding problem on 2D and 3D lattices (Q876470) (← 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)
- Improving graph partitions using submodular functions. (Q1410700) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
- The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- The maximum exposure problem (Q2123293) (← links)
- Finding lasting dense subgraphs (Q2218373) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms (Q2448193) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← 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)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Dense Subgraphs in Biological Networks (Q3297795) (← links)
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) (← links)
- A graph-based active learning method for classification of remote sensing images (Q4571048) (← links)
- Mining relevant information on the Web: a clique-based approach (Q5444416) (← links)
- Finding a Dense-Core in Jellyfish Graphs (Q5458298) (← links)
- The Maximum Exposure Problem. (Q5875471) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)
- The sparse sequences of graphs (Q6640961) (← links)
