On the public citation graph
Faster SDP Hierarchy Solvers for Local Rounding Algorithms
0 signed · 35 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4614-0769-0_6openalex-snapshot
Convex Relaxations and Integrality Gaps
inferredcites →https://doi.org/10.1007/978-3-319-21275-3_14openalex-snapshot
Lower Bounds Based on the Exponential-Time Hypothesis
inferredcites →https://doi.org/10.1007/978-3-540-85363-3_5openalex-snapshot
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
inferredcites →https://doi.org/10.1007/978-3-642-15369-3_10openalex-snapshot
Approximating Sparsest Cut in Graphs of Bounded Treewidth
inferredcites →https://doi.org/10.1007/978-3-642-20807-2_24openalex-snapshot
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_1openalex-snapshot
New Tools for Graph Coloring
inferredcites →https://doi.org/10.1007/978-3-642-78240-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1023/a:1008203903341openalex-snapshot
On the Complexity of Semidefinite Programs
inferredcites →https://doi.org/10.1109/focs.2009.37openalex-snapshot
SDP Integrality Gaps with Local ell_1-Embeddability
inferredcites →https://doi.org/10.1109/focs.2009.73openalex-snapshot
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
inferredcites →https://doi.org/10.1109/focs.2010.38openalex-snapshot
Efficient Volume Sampling for Row/Column Subset Selection
inferredcites →https://doi.org/10.1109/focs.2011.36openalex-snapshot
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
inferredcites →https://doi.org/10.1109/focs.2011.95openalex-snapshot
Rounding Semidefinite Programming Hierarchies via Global Correlation
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/1.9781611973099.33openalex-snapshot
Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies
inferredcites →https://doi.org/10.1137/1.9781611973099.95openalex-snapshot
Optimal Column-Based Low-Rank Matrix Reconstruction
inferredcites →https://doi.org/10.1137/s1052623400380079openalex-snapshot
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
inferredcites →https://doi.org/10.1145/2213977.2214006openalex-snapshot
Hypercontractivity, sum-of-squares proofs, and their applications
inferredcites →https://doi.org/10.1287/moor.28.3.470.16391openalex-snapshot
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.74openalex-snapshot
Approximating Directed Steiner Problems via Tree Embedding
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.21053openalex-snapshot
A unified view of graph regularity via matrix decompositions
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_24openalex-snapshot
Linear Programming Hierarchies Suffice for Directed Steiner Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_22openalex-snapshot
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
inferred← citeshttps://doi.org/10.1109/focs.2013.37openalex-snapshot
Towards a Better Approximation for Sparsest Cut?
inferred← citeshttps://doi.org/10.1109/focs.2019.00021openalex-snapshot
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders
inferred← citeshttps://doi.org/10.1137/1.9781611976465.24openalex-snapshot
SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation
inferred← citeshttps://doi.org/10.1145/2488608.2488611openalex-snapshot
Improved Cheeger's inequality
inferred← citeshttps://doi.org/10.1145/2897518.2897529openalex-snapshot
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
inferred← citeshttps://doi.org/10.1145/3178538openalex-snapshot
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique
inferred← citeshttps://doi.org/10.1145/3519935.3520012openalex-snapshot
Clustering mixtures with almost optimal separation in polynomial time
inferred← citeshttps://doi.org/10.5555/2627817.2627839openalex-snapshot
Approximating non-uniform sparsest cut via generalized spectra
inferred← citeshttps://doi.org/10.5802/afst.1465openalex-snapshot
Spectral Graph Theory via Higher Order Eigenvalues and Applications to the Analysis of Random Walks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.