On the public citation graph
Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming
0 signed · 100 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.1006/jagm.2000.1154openalex-snapshot
A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p
inferredcites →https://doi.org/10.1007/bf02523688openalex-snapshot
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/s0377-0427(97)00153-2openalex-snapshot
Linear systems in Jordan algebras and primal-dual interior-point algorithms
inferredcites →https://doi.org/10.1109/istcs.1995.377033openalex-snapshot
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
inferredcites →https://doi.org/10.1109/sfcs.1998.743424openalex-snapshot
A tight characterization of NP with 3 query PCPs
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s0097539796309326openalex-snapshot
Derandomizing Approximation Algorithms Based on Semidefinite Programming
inferredcites →https://doi.org/10.1137/s0895479896303739openalex-snapshot
The Chebyshev Polynomials of a Matrix
inferredcites →https://doi.org/10.1137/s0895480195296221openalex-snapshot
A Geometric Approach to Betweenness
inferredcites →https://doi.org/10.1137/s1052623495290209openalex-snapshot
Primal-Dual Interior-Point Methods for Self-Scaled Cones
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/258533.258660openalex-snapshot
Consistent hashing and random trees
inferredcites →https://doi.org/10.1145/274787.274791openalex-snapshot
Approximate graph coloring by semidefinite programming
inferredcites →https://doi.org/10.1145/276698.276856openalex-snapshot
Checking polynomial identities over any field
inferredcites →https://doi.org/10.1145/375827.375840openalex-snapshot
Convex quadratic and semidefinite programming relaxations in scheduling
inferredcites →https://doi.org/10.1145/380752.380838openalex-snapshot
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
inferredcites →https://doi.org/10.1287/moor.21.4.860openalex-snapshot
Barrier Functions in Interior Point Methods
inferredcites →https://doi.org/10.1287/moor.22.1.1openalex-snapshot
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
inferredcites →https://doi.org/10.2307/2583689openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
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.eorms0755openalex-snapshot
Semidefinite Optimization Applications
inferred← citeshttps://doi.org/10.1002/rsa.20096openalex-snapshot
MAXk‐CUT and approximating the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_9openalex-snapshot
Invariant Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_107openalex-snapshot
Scheduling Three Identical Parallel Machines with Capacity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-44992-6_15openalex-snapshot
Nonlinear Systems for Unconventional Computing
inferred← citeshttps://doi.org/10.1007/978-3-031-85884-0_19openalex-snapshot
Data Clustering and Visualization with Recursive Max k-Cut Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_28openalex-snapshot
A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_38openalex-snapshot
Product Rules in Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_20openalex-snapshot
Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_9openalex-snapshot
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_1openalex-snapshot
A New Point of NP-Hardness for 2-to-1 Label Cover
inferred← citeshttps://doi.org/10.1007/s10107-006-0064-6openalex-snapshot
On approximating complex quadratic optimization problems via semidefinite programming relaxations
inferred← citeshttps://doi.org/10.1007/s10107-007-0139-zopenalex-snapshot
The capacitated max k-cut problem
inferred← citeshttps://doi.org/10.1007/s10107-013-0738-9openalex-snapshot
Phase recovery, MaxCut and complex semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-016-1059-6openalex-snapshot
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
inferred← citeshttps://doi.org/10.1007/s10107-024-02147-3openalex-snapshot
Cuts and semidefinite liftings for the complex cut polytope
inferred← citeshttps://doi.org/10.1007/s10288-012-0210-3openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10479-015-2015-1openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10589-025-00672-1openalex-snapshot
Quadratic convex reformulations for a class of complex quadratic programming problems
inferred← citeshttps://doi.org/10.1007/s10878-015-9880-zopenalex-snapshot
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
inferred← citeshttps://doi.org/10.1007/s10898-017-0551-8openalex-snapshot
Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
inferred← citeshttps://doi.org/10.1007/s10898-021-00999-zopenalex-snapshot
A branch-and-bound algorithm for solving max-k-cut problem
inferred← citeshttps://doi.org/10.1007/s10898-022-01183-7openalex-snapshot
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
inferred← citeshttps://doi.org/10.1007/s10898-023-01290-zopenalex-snapshot
New semidefinite relaxations for a class of complex quadratic programming problems
inferred← citeshttps://doi.org/10.1007/s10957-019-01558-zopenalex-snapshot
Frequency-Hopping Code Design for Target Detection via Optimization Theory
inferred← citeshttps://doi.org/10.1007/s11425-010-0087-6openalex-snapshot
Approximation algorithms for indefinite complex quadratic maximization problems
inferred← citeshttps://doi.org/10.1007/s11425-010-3087-7openalex-snapshot
Approximation algorithms for indefinite complex quadratic maximization problems
inferred← citeshttps://doi.org/10.1007/s12532-020-00186-3openalex-snapshot
Mixed-integer programming techniques for the connected max-k-cut problem
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.002openalex-snapshot
A class of spectral bounds for Max k -Cut
inferred← citeshttps://doi.org/10.1016/j.jpaa.2020.106610openalex-snapshot
Conic stability of polynomials and positive maps
inferred← citeshttps://doi.org/10.1016/j.laa.2023.01.008openalex-snapshot
Approximating projections by quantum operations
inferred← citeshttps://doi.org/10.1021/acs.jpca.1c02267openalex-snapshot
Conductance Switching in an Organometallic Single-Electron Transistor Using Current-Constrained Reduced-Density Matrix Theory
inferred← citeshttps://doi.org/10.1023/b:joco.0000038911.67280.3fopenalex-snapshot
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
inferred← citeshttps://doi.org/10.1038/s42004-018-0030-2openalex-snapshot
Current-constrained density-matrix theory to calculate molecular conductivity with increased accuracy
inferred← citeshttps://doi.org/10.1080/02331934.2011.592527openalex-snapshot
An approximation algorithm for maxk-uncut with capacity constraints
inferred← citeshttps://doi.org/10.1080/23307706.2017.1397554openalex-snapshot
A rewriting system for convex optimization problems
inferred← citeshttps://doi.org/10.1088/1742-6596/1719/1/012100openalex-snapshot
Quantum approximate optimization and k-means algorithms for data clustering
inferred← citeshttps://doi.org/10.1101/2021.09.10.459594openalex-snapshot
How biological cells including platelets and megakaryocytes decide complex problems fast but risky
inferred← citeshttps://doi.org/10.1103/physreva.100.032509openalex-snapshot
Orbital angular momentum constraints in the variational optimization of the two-electron reduced-density matrix
inferred← citeshttps://doi.org/10.1103/physreva.109.012436openalex-snapshot
Probabilistic tensor optimization of quantum circuits for the max−k−cut problem
inferred← citeshttps://doi.org/10.1103/physreva.91.052327openalex-snapshot
Optimal Trotterization in universal quantum simulators under faulty control
inferred← citeshttps://doi.org/10.1103/physrevapplied.17.024063openalex-snapshot
Solving the Max-3-Cut Problem with Coherent Networks
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736503openalex-snapshot
Optimal decentralized control problem as a rank-constrained optimization
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760020openalex-snapshot
On the exactness of semidefinite relaxation for nonlinear optimization over graphs: Part I
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039733openalex-snapshot
Graph-theoretic algorithms for polynomial optimization problems
inferred← citeshttps://doi.org/10.1109/cso.2009.443openalex-snapshot
An Approximation Algorithm for Max k-Uncut with Capacity Constraints
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00061openalex-snapshot
Approximation Algorithms for Noncommutative CSPs
inferred← citeshttps://doi.org/10.1109/globecom42002.2020.9348236openalex-snapshot
Reconfigurable Intelligent Surface Empowered Symbiotic Radio over Broadcasting Signals
inferred← citeshttps://doi.org/10.1109/icnidc.2010.5657849openalex-snapshot
An algorithm based on SDP to solve distance calculation problem in OVFDM communication system
inferred← citeshttps://doi.org/10.1109/jiot.2020.3015995openalex-snapshot
Robust Design for NOMA-Based Multibeam LEO Satellite Internet of Things
inferred← citeshttps://doi.org/10.1109/ojsp.2020.3020221openalex-snapshot
An Enhanced SDR Based Global Algorithm for Nonconvex Complex Quadratic Programs With Signal Processing Applications
inferred← citeshttps://doi.org/10.1109/paap.2011.35openalex-snapshot
A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph
inferred← citeshttps://doi.org/10.1109/radarconf2351548.2023.10149631openalex-snapshot
Beampattern design for radars with reconfigurable intelligent surfaces
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3096933openalex-snapshot
Reconfigurable Intelligent Surface Empowered Symbiotic Radio Over Broadcasting Signals
inferred← citeshttps://doi.org/10.1109/tifs.2016.2611478openalex-snapshot
Probabilistically Robust SWIPT for Secrecy MISOME Systems
inferred← citeshttps://doi.org/10.1109/tsp.2008.2008247openalex-snapshot
Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
inferred← citeshttps://doi.org/10.1109/tsp.2011.2128313openalex-snapshot
Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint
inferred← citeshttps://doi.org/10.1109/tsp.2014.2354312openalex-snapshot
Outage Constrained Robust Transmit Optimization for Multiuser MISO Downlinks: Tractable Approximations by Conic Optimization
inferred← citeshttps://doi.org/10.1109/tsp.2022.3157975openalex-snapshot
Foundations of MIMO Radar Detection Aided by Reconfigurable Intelligent Surfaces
inferred← citeshttps://doi.org/10.1109/twc.2022.3213614openalex-snapshot
Wireless Powered Intelligent Reflecting Surface for Improving Broadcasting Channels
inferred← citeshttps://doi.org/10.1109/wcsp.2019.8928063openalex-snapshot
Secure Transmission Strategy for Intelligent Reflecting Surface Enhanced Wireless System
inferred← citeshttps://doi.org/10.1137/04061341xopenalex-snapshot
Complex Quadratic Optimization and Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/050642691openalex-snapshot
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
inferred← citeshttps://doi.org/10.1137/130915261openalex-snapshot
Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
inferred← citeshttps://doi.org/10.1137/17m115075xopenalex-snapshot
Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
inferred← citeshttps://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferred← citeshttps://doi.org/10.1145/2213836.2213874openalex-snapshot
Towards a unified architecture for in-RDBMS analytics
inferred← citeshttps://doi.org/10.1145/2537800openalex-snapshot
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
inferred← citeshttps://doi.org/10.1155/2012/475018openalex-snapshot
A VNS Metaheuristic with Stochastic Steps for Max 3‐Cut and Max 3‐Section
inferred← citeshttps://doi.org/10.1287/opre.1080.0635openalex-snapshot
Conflict Resolution in the Scheduling of Television Commercials
inferred← citeshttps://doi.org/10.1360/ssm-2020-0035openalex-snapshot
Modern optimization theory and applications
inferred← citeshttps://doi.org/10.1364/josaa.32.001160openalex-snapshot
Modal-based phase retrieval for adaptive optics
inferred← citeshttps://doi.org/10.21248/gups.73291openalex-snapshot
Properties of conically stable polynomials and imaginary projections
inferred← citeshttps://doi.org/10.32657/10356/48908openalex-snapshot
An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming
inferred← citeshttps://doi.org/10.3934/jimo.2022250openalex-snapshot
A semidefinite relaxation based global algorithm for two-level graph partition problem
inferred← citeshttps://doi.org/10.70675/f624da58zbc63z412dz85f3z5ed70ae087d3openalex-snapshot
Wavelet transform modulus : phase retrieval and scattering
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.