On the public citation graph
https://doi.org/10.4086/toc.2006.v002a002
0 signed · 95 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/bf01585563openalex-snapshot
Worst-case comparison of valid inequalities for the TSP
inferredcites →https://doi.org/10.1007/bfb0120913openalex-snapshot
Heuristic analysis, linear programming and branch and bound
inferredcites →https://doi.org/10.1007/s00493-006-0008-zopenalex-snapshot
On The Approximability Of The Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/s004930170005openalex-snapshot
Critical Facets of the Stable Set Polytope
inferredcites →https://doi.org/10.1016/0022-0000(91)90024-yopenalex-snapshot
Expressing combinatorial optimization problems by Linear Programs
inferredcites →https://doi.org/10.1057/palgrave.jors.2601377openalex-snapshot
Approximation Algorithms
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/s009753970240118xopenalex-snapshot
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
inferredcites →https://doi.org/10.1145/195058.195216openalex-snapshot
.879-approximation algorithms for MAX CUT and MAX 2SAT
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1287/moor.26.4.796.10012openalex-snapshot
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0479openalex-snapshot
Lovász‐Schrijver Reformulation
inferred← citeshttps://doi.org/10.1007/11523468_76openalex-snapshot
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
inferred← citeshttps://doi.org/10.1007/11523468_95openalex-snapshot
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/11538462_20openalex-snapshot
Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_6openalex-snapshot
Convex Relaxations and Integrality Gaps
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_13openalex-snapshot
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_5openalex-snapshot
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_10openalex-snapshot
Optimal Sherali-Adams Gaps from Pairwise Independence
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_10openalex-snapshot
Approximating Sparsest Cut in Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_23openalex-snapshot
Approximate Lasserre Integrality Gap for Unique Games
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_28openalex-snapshot
Improving Integrality Gaps via Chvátal-Gomory Rounding
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_24openalex-snapshot
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_29openalex-snapshot
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy
inferred← citeshttps://doi.org/10.1007/s00037-011-0027-zopenalex-snapshot
Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy
inferred← citeshttps://doi.org/10.1007/s00037-011-0028-yopenalex-snapshot
Toward a Model for Backtracking and Dynamic Programming
inferred← citeshttps://doi.org/10.1007/s00453-009-9385-1openalex-snapshot
A Stronger Model of Dynamic Programming Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-013-9747-6openalex-snapshot
Limitations of Incremental Dynamic Programming
inferred← citeshttps://doi.org/10.1007/s10107-015-0916-zopenalex-snapshot
Integrality gaps for strengthened linear relaxations of capacitated facility location
inferred← citeshttps://doi.org/10.1007/s10107-015-0947-5openalex-snapshot
On integrality ratios for asymmetric TSP in the Sherali–Adams hierarchy
inferred← citeshttps://doi.org/10.1007/s10107-017-1152-5openalex-snapshot
Semidefinite and linear programming integrality gaps for scheduling identical machines
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.027openalex-snapshot
Strong and weak edges of a graph and linkages with the vertex cover problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.01.004openalex-snapshot
Sherali–Adams relaxations of graph isomorphism polytopes
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.01.005openalex-snapshot
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.07.001openalex-snapshot
The strength of Dantzig–Wolfe reformulations for the stable set and related problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.12.003openalex-snapshot
Integrality gaps for colorful matchings
inferred← citeshttps://doi.org/10.1016/j.orl.2009.01.010openalex-snapshot
An edge-reduction algorithm for the vertex cover problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.009openalex-snapshot
Approximability of the capacitated b -edge dominating set problem
inferred← citeshttps://doi.org/10.1021/acs.jcim.4c02217openalex-snapshot
Algorithm for Efficient Superposition and Clustering of Molecular Assemblies Using the Branch-and-Bound Method
inferred← citeshttps://doi.org/10.1109/ccc.2006.28openalex-snapshot
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy
inferred← citeshttps://doi.org/10.1109/epec.2012.6474967openalex-snapshot
Smart Agent Oriented Linear Programming (AOLP) control in electric grid
inferred← citeshttps://doi.org/10.1109/focs.2007.13openalex-snapshot
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/focs.2007.34openalex-snapshot
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
inferred← citeshttps://doi.org/10.1109/focs.2007.35openalex-snapshot
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
inferred← citeshttps://doi.org/10.1109/focs.2007.37openalex-snapshot
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1109/focs.2007.64openalex-snapshot
Local Global Tradeoffs in Metric Embeddings
inferred← citeshttps://doi.org/10.1109/focs.2007.72openalex-snapshot
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
inferred← citeshttps://doi.org/10.1109/focs.2008.74openalex-snapshot
Linear Level Lasserre Lower Bounds for Certain k-CSPs
inferred← citeshttps://doi.org/10.1109/focs.2009.73openalex-snapshot
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
inferred← citeshttps://doi.org/10.1109/focs.2011.95openalex-snapshot
Rounding Semidefinite Programming Hierarchies via Global Correlation
inferred← citeshttps://doi.org/10.1109/focs.2013.45openalex-snapshot
Approximate Constraint Satisfaction Requires Large LP Relaxations
inferred← citeshttps://doi.org/10.1109/focs.2015.73openalex-snapshot
No Small Linear Program Approximates Vertex Cover within a Factor 2 -- e
inferred← citeshttps://doi.org/10.1137/060654645openalex-snapshot
Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1137/070700103openalex-snapshot
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to $\ell_1$ Embeddability of Negative Type Metrics
inferred← citeshttps://doi.org/10.1137/070712080openalex-snapshot
Local Global Tradeoffs in Metric Embeddings
inferred← citeshttps://doi.org/10.1137/080721479openalex-snapshot
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy
inferred← citeshttps://doi.org/10.1137/090780304openalex-snapshot
Local Versus Global Properties of Metric Spaces
inferred← citeshttps://doi.org/10.1137/1.9781611973082.41openalex-snapshot
Subsampling Mathematical Relaxations and Average-case Complexity
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch86openalex-snapshot
Approximate Graph Colouring and Crystals
inferred← citeshttps://doi.org/10.1137/100816833openalex-snapshot
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász–Schrijver Procedures
inferred← citeshttps://doi.org/10.1137/120867834openalex-snapshot
Sherali--Adams Relaxations and Indistinguishability in Counting Logics
inferred← citeshttps://doi.org/10.1137/20m1359584openalex-snapshot
Superlinear Integrality Gaps for the Minimum Majority Problem
inferred← citeshttps://doi.org/10.1137/24m1638628openalex-snapshot
Semidefinite Programming and Linear Equations vs. Homomorphism Problems
inferred← citeshttps://doi.org/10.1137/24m1691594openalex-snapshot
Approximate Graph Coloring and the Crystal with a Hollow Shadow
inferred← citeshttps://doi.org/10.1145/1060590.1060634openalex-snapshot
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
inferred← citeshttps://doi.org/10.1145/1250790.1250836openalex-snapshot
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
inferred← citeshttps://doi.org/10.1145/1536414.1536455openalex-snapshot
Integrality gaps for Sherali-Adams relaxations
inferred← citeshttps://doi.org/10.1145/1536414.1536456openalex-snapshot
Sherali-adams relaxations of the matching polytope
inferred← citeshttps://doi.org/10.1145/1597036.1597045openalex-snapshot
A better approximation ratio for the vertex cover problem
inferred← citeshttps://doi.org/10.1145/1978782.1978784openalex-snapshot
How well can primal-dual and local-ratio algorithms perform?
inferred← citeshttps://doi.org/10.1145/2090236.2090265openalex-snapshot
Sherali-Adams relaxations and indistinguishability in counting logics
inferred← citeshttps://doi.org/10.1145/2213977.2213988openalex-snapshot
Linear vs. semidefinite extended formulations
inferred← citeshttps://doi.org/10.1145/2591796.2591886openalex-snapshot
Rounding sum-of-squares relaxations
inferred← citeshttps://doi.org/10.1145/2716307openalex-snapshot
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1145/2746539.2746549openalex-snapshot
Hardness of Graph Pricing Through Generalized Max-Dicut
inferred← citeshttps://doi.org/10.1145/2746539.2746625openalex-snapshot
Sum of Squares Lower Bounds from Pairwise Independence
inferred← citeshttps://doi.org/10.1145/3564246.3585112openalex-snapshot
Approximate Graph Colouring and the Hollow Shadow
inferred← citeshttps://doi.org/10.1145/3618260.3649635openalex-snapshot
Semidefinite Programming and Linear Equations vs. Homomorphism Problems
inferred← citeshttps://doi.org/10.1215/00127094-3119525openalex-snapshot
Expanders with respect to Hadamard spaces and random graphs
inferred← citeshttps://doi.org/10.1287/moor.2017.0918openalex-snapshot
No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.8openalex-snapshot
Sherali - Adams Strikes Back
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3970openalex-snapshot
Approximating Sparsest Cut in Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0837openalex-snapshot
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1204.5489openalex-snapshot
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1305.5998openalex-snapshot
Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location
inferred← citeshttps://doi.org/10.48550/arxiv.1405.0945openalex-snapshot
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy
inferred← citeshttps://doi.org/10.5555/1496770.1496810openalex-snapshot
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
inferred← citeshttps://doi.org/10.5555/2095116.2095150openalex-snapshot
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
inferred← citeshttps://doi.org/10.5555/2634074.2634193openalex-snapshot
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph
inferred← citeshttps://doi.org/10.7282/t3pz5bhqopenalex-snapshot
Algorithmic and complexity results for boolean and pseudo-boolean functions
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.