Losing Weight by Gaining Edges
From MaRDI portal
Publication:2921387
DOI10.1007/978-3-662-44777-2_1zbMath1423.68197arXiv1311.3054OpenAlexW15998695MaRDI QIDQ2921387
Kevin Lewi, Amir Abboud, R. Ryan Williams
Publication date: 8 October 2014
Published in: Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.3054
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items (8)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? ⋮ If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Unnamed Item ⋮ Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. ⋮ A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem ⋮ An iterative method for linear decomposition of index generating functions ⋮ On Multidimensional and Monotone k-SUM
This page was built for publication: Losing Weight by Gaining Edges
