The following pages link to Detecting high log-densities (Q2875146):
Displayed 34 items.
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- Bin Packing with Colocations (Q2971155) (← 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)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- Graph Stabilization: A Survey (Q4689625) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- (Q5002730) (← links)
- (Q5009495) (← links)
- (Q5009502) (← links)
- Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
- (Q5091190) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
- (Q5140849) (← links)
- (Q5158500) (← links)
- Testing for Dense Subsets in a Graph via the Partition Function (Q5212953) (← links)
- (Q5743407) (← links)
- (Q5743436) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- The Maximum Exposure Problem. (Q5875471) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← 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)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- (Q6084394) (← links)
- New algorithms for a simple measure of network partitioning (Q6111946) (← links)
- An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs (Q6130647) (← links)
- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6149053) (← links)