The following pages link to Detecting high log-densities (Q2875146):
Displaying 50 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Survivable network activation problems (Q386909) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- The ordered covering problem (Q722532) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- Strengthening ties towards a highly-connected world (Q832669) (← links)
- Computing the partition function for graph homomorphisms with multiplicities (Q889510) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← 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)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
- Using shortcut edges to maximize the number of triangles in graphs (Q1785441) (← links)
- The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- The maximum exposure problem (Q2123293) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Additive stabilizers for unstable graphs (Q2419360) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← 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)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)