Pages that link to "Item:Q4978037"

The following pages link to Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037):

Displaying 50 items.

• The ordered covering problem (Q722532) (← links)
• Sparsification and subexponential approximation (Q1702300) (← links)
• In search of the densest subgraph (Q2005555) (← links)
• Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
• Graph classes and approximability of the happy set problem (Q2019476) (← links)
• Election control through social influence with unknown preferences (Q2019485) (← links)
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
• On the complexity of fair house allocation (Q2060606) (← links)
• Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
• Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
• New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
• Dual domination problems in graphs (Q2136849) (← links)
• Election control through social influence with voters' uncertainty (Q2168756) (← links)
• Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
• Approximation and hardness of shift-Bribery (Q2238694) (← links)
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← 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)
• Orienteering for electioneering (Q2417102) (← links)
• Additive stabilizers for unstable graphs (Q2419360) (← 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)
• Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
• Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph (Q2875146) (← links)
• The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
• LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
• The Densest k-Subhypergraph Problem (Q4636436) (← links)
• (Q4638096) (← links)
• Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
• ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• (Q5009502) (← links)
• Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem (Q5140849) (← links)
• Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition (Q5154753) (← links)
• (Q5158500) (← links)
• Jointly low-rank and bisparse recovery: Questions and partial answers (Q5220065) (← links)
• Multitasking Capacity: Hardness Results and Improved Constructions (Q5220467) (← links)
• Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
• $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← 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)
• A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
• (Q6084394) (← links)
• An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs (Q6130647) (← links)
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
• A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673) (← links)
• A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6663517) (← links)