Search results for "max-cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
100	Ryan O'Donnell, Yi Wu 0002	An optimal sdp algorithm for max-cut, and equally optimal long code tests.	STOC	2008	DBLP DOI BibTeX RDF	semidefinite programming, hardness of approximation, max-cut
90	Teofilo F. Gonzalez, Toshio Murayama	Alhorithms for a Class of Min-Cut and Max-Cut Problem.	ISAAC	1992	DBLP DOI BibTeX RDF
78	Monia Giandomenico, Adam N. Letchford	Exploring the Relationship Between Max-Cut and Stable Set Relaxations.	Math. Program.	2006	DBLP DOI BibTeX RDF	Stable set problem, Polyhedral combinatorics, Max-cut problem
68	Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell	Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?	FOCS	2004	DBLP DOI BibTeX RDF
67	Daya Ram Gaur, Ramesh Krishnamurti	Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability.	ISAAC	1999	DBLP DOI BibTeX RDF	hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut
61	Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier	Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's.	WEA	2004	DBLP DOI BibTeX RDF
59	Michael Lewin, Dror Livnat, Uri Zwick	Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems.	IPCO	2002	DBLP DOI BibTeX RDF
55	Franz Rendl, Giovanni Rinaldi, Angelika Wiegele	Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C20, 90C27, 90C22
54	Uriel Feige, Gideon Schechtman	On the integrality ratio of semidefinite relaxations of MAX CUT.	STOC	2001	DBLP DOI BibTeX RDF
54	Emely Arráiz, Oswaldo Olivo	Competitive simulated annealing and Tabu Search algorithms for the max-cut problem.	GECCO	2009	DBLP DOI BibTeX RDF	algorithms, simulated annealing, Tabu Search, metaheuristic, max-cut
54	Abraham Duarte, Ángel Sánchez, Felipe Fernández, Raúl Cabido	A low-level hybridization between memetic algorithm and VNS for the max-cut problem.	GECCO	2005	DBLP DOI BibTeX RDF	evolutionary algorithms, metaheuristic, memetic algorithms, max-cut, VNS
53	Hongwei Liu 0001, Sanyang Liu, Fengmin Xu	A Tight Semidefinite Relaxation of the MAX CUT Problem.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	semidefinite relaxation, cut polytope, metric polytope, MAX CUT problem
52	Piotr Berman, Marek Karpinski	On Some Tighter Inapproximability Results (Extended Abstract).	ICALP	1999	DBLP DOI BibTeX RDF	Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
50	Adi Avidor, Uri Zwick	Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
49	David P. Williamson	Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture).	WG	1997	DBLP DOI BibTeX RDF
48	Tommy Färnqvist, Peter Jonsson, Johan Thapper	Approximability Distance in the Space of H-Colourability Problems.	CSR	2009	DBLP DOI BibTeX RDF	graph H-colouring, computational complexity, approximability, optimisation, graph homomorphism
46	Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick	Separating MAX 2-AND, MAX DI-CUT and MAX CUT.	FOCS	2023	DBLP DOI BibTeX RDF
46	Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick	Separating MAX 2-AND, MAX DI-CUT and MAX CUT.	CoRR	2022	DBLP DOI BibTeX RDF
45	Franz Rendl, Giovanni Rinaldi, Angelika Wiegele	A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.	IPCO	2007	DBLP DOI BibTeX RDF
45	Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani	Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut.	STOC	2007	DBLP DOI BibTeX RDF	Lovasz-Schrijver hierarchy, approximation algorithms, linear programming, integrality gap
45	Federico Della Croce, Vangelis Th. Paschos	Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.	Oper. Res.	2008	DBLP DOI BibTeX RDF	Dominance conditions, Set covering, Max cut, Worst-case complexity
44	Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen	Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems.	CSR	2007	DBLP DOI BibTeX RDF	maximum constraint satisfaction, complexity, approximability
40	Luca Trevisan	Max cut and the smallest eigenvalue.	STOC	2009	DBLP DOI BibTeX RDF	maximum cut, spectral partitioning
40	Petros Drineas, Ravi Kannan, Michael W. Mahoney	Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms.	STACS	2005	DBLP DOI BibTeX RDF
40	Wenceslas Fernandez de la Vega, Claire Kenyon	A Randomized Approximation Scheme for Metric MAX-CUT.	FOCS	1998	DBLP DOI BibTeX RDF
39	Sagi Snir, Satish Rao	Using Max Cut to Enhance Rooted Trees Consistency.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	rooted triplets, semidefinite programming, Phylogenetic trees, supertrees
39	Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos	Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold.	ESA	2006	DBLP DOI BibTeX RDF
39	Martin Fürer, Shiva Prasad Kasiviswanathan	Exact Max 2-Sat: Easier and Faster.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
37	Amey Bhangale, Subhash Khot	Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut.	CCC	2020	DBLP DOI BibTeX RDF
37	Amey Bhangale, Subhash Khot	Simultaneous Max-Cut is harder to approximate than Max-Cut.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
37	Moses Charikar, Konstantin Makarychev, Yury Makarychev	Integrality gaps for Sherali-Adams relaxations.	STOC	2009	DBLP DOI BibTeX RDF	Sherali-Adams hierarchy, lift-and-project methods, local-global metric spaces
36	Alain Billionnet, Sourour Elloumi	Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem.	Math. Program.	2007	DBLP DOI BibTeX RDF	Quadratic 0-1 optimization, Convex quadratic relaxation, Semidefinite positive relaxation, Experiments, Integer programming, Max-cut
35	Fengmin Xu, Chengxian Xu	A Continuous Method for Solving Multiuser Detection in CDMA.	AAIM	2005	DBLP DOI BibTeX RDF	Penalty function method, Convex function, Max cut problem
35	Alexander A. Ageev, Maxim Sviridenko	Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	rounding technique, maximum coverage, approximation algorithm, performance guarantee, max cut, linear relaxation
33	Howard J. Karloff, Uri Zwick	A 7/8-Approximation Algorithm for MAX 3SAT?	FOCS	1997	DBLP DOI BibTeX RDF
32	Johan Håstad	Some optimal inapproximability results.	J. ACM	2001	DBLP DOI BibTeX RDF	NP-hard optimization problems, max-sat, linear equations, Inapproximability, probabilistically checkable proofs
31	Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis	Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy.	FOCS	2007	DBLP DOI BibTeX RDF
29	Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov	Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C27
29	Eric Angel, Evripidis Bampis, Laurent Gourvès	Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.	WG	2005	DBLP DOI BibTeX RDF
29	Abraham Duarte, Felipe Fernández, Ángel Sánchez 0001, Antonio S. Montemayor	A Hierarchical Social Metaheuristic for the Max-Cut Problem.	EvoCOP	2004	DBLP DOI BibTeX RDF
29	Eran Halperin, Dror Livnat, Uri Zwick	MAX CUT in cubic graphs.	SODA	2002	DBLP BibTeX RDF
28	Sudhanshu Chanpuriya, Cameron Musco	Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More.	CoRR	2023	DBLP DOI BibTeX RDF
28	Orestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg	On the cut-query complexity of approximating max-cut.	CoRR	2022	DBLP DOI BibTeX RDF
28	Mourad Baïou, Francisco Barahona	Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.	Math. Program.	2018	DBLP DOI BibTeX RDF
28	Vladimir A. Bondarenko, Andrei V. Nikolaev	On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems.	Int. J. Math. Math. Sci.	2016	DBLP DOI BibTeX RDF
28	Mourad Baïou, Francisco Barahona	Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem.	IPCO	2016	DBLP DOI BibTeX RDF
28	Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan	Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut.	SODA	2014	DBLP DOI BibTeX RDF
28	Clayton W. Commander	Maximum Cut Problem, MAX-CUT.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF
28	Francisco Barahona, Laszlo Ladányi	Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.	RAIRO Oper. Res.	2006	DBLP DOI BibTeX RDF
28	Michele Conforti, M. R. Rao	Some New Matroids on Graphs: Cut Sets and the Max Cut Problem.	Math. Oper. Res.	1987	DBLP DOI BibTeX RDF
28	Pan Peng 0001, Yuichi Yoshida	Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders.	SODA	2023	DBLP DOI BibTeX RDF
28	Pan Peng 0001, Yuichi Yoshida	Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders.	CoRR	2022	DBLP DOI BibTeX RDF
28	Xi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang 0002	Smoothed complexity of local max-cut and binary max-CSP.	STOC	2020	DBLP DOI BibTeX RDF
28	Xi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang 0002	Smoothed complexity of local Max-Cut and binary Max-CSP.	CoRR	2019	DBLP BibTeX RDF
28	Josep Díaz, Marcin Kaminski 0001	MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
28	Alexander D. Scott, Gregory B. Sorkin	Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time.	Comb. Probab. Comput.	2006	DBLP DOI BibTeX RDF
28	Josep Díaz, Marcin Kaminski 0001	Max-Cut and Max-Bisection are NP-hard on unit disk graphs	CoRR	2006	DBLP BibTeX RDF
28	Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin	Random MAX SAT, random MAX CUT, and their phase transitions.	Random Struct. Algorithms	2004	DBLP DOI BibTeX RDF
28	Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith	Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
28	Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin	Random MAX SAT, random MAX CUT, and their phase transitions.	SODA	2003	DBLP BibTeX RDF
28	Alex D. Scott, Gregory B. Sorkin	Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
28	Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith	New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT	Electron. Colloquium Comput. Complex.	2000	DBLP BibTeX RDF
28	Michel X. Goemans, David P. Williamson	.879-approximation algorithms for MAX CUT and MAX 2SAT.	STOC	1994	DBLP DOI BibTeX RDF
27	Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov	Solution and Optimization of Systems of Pseudo-Boolean Constraints.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Pseudo Boolean (PB), Max-ONE, Global Routing, Conjunctive Normal Form (CNF), Backtrack Search, Integer Linear Programming (ILP), Max-SAT, Boolean Satisfiability (SAT)
27	Alexander D. Scott, Gregory B. Sorkin	An LP-Designed Algorithm for Constraint Satisfaction.	ESA	2006	DBLP DOI BibTeX RDF
27	Ryan Williams 0001	A New Algorithm for Optimal Constraint Satisfaction and Its Implications.	ICALP	2004	DBLP DOI BibTeX RDF
27	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Generic ILP versus specialized 0-1 ILP: an update.	ICCAD	2002	DBLP DOI BibTeX RDF
27	Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski	Random sampling and approximation of MAX-CSP problems.	STOC	2002	DBLP DOI BibTeX RDF
27	Burkhard Monien, Ivan Hal Sudborough	Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey).	MFCS	1981	DBLP DOI BibTeX RDF
26	HoonSang Jin, Andreas Kuehlmann, Fabio Somenzi	Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis.	TACAS	2002	DBLP DOI BibTeX RDF
26	Noga Alon, Benny Sudakov, Uri Zwick	Constructing worst case instances for semidefinite programming based approximation algorithms.	SODA	2001	DBLP BibTeX RDF
25	Hua Xiang 0001, Kai-Yuan Chao, Martin D. F. Wong	Exact Algorithms for Coupling Capacitance Minimization by Adding One Metal Layer.	ISQED	2005	DBLP DOI BibTeX RDF	Layer migration, Max-cut, Capacitance coupling
25	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
25	Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001	Free Bits, PCPs and Non-Approximability - Towards Tight Results.	FOCS	1995	DBLP DOI BibTeX RDF	free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability
25	Sanjeev Arora, Carsten Lund, Rajeev Motwani 0001, Madhu Sudan 0001, Mario Szegedy	Proof Verification and Hardness of Approximation Problems	FOCS	1992	DBLP DOI BibTeX RDF	approximation problems, polynomial-time probabilistic oracle machine, random bits, MAXSNP-hard, metric TSP, time complexity, NP, MAX-CUT, MAX-SAT, proof verification
24	Liu Zheng	A Novel Graph-Based Image Annotation Refinement Algorithm.	FSKD (5)	2009	DBLP DOI BibTeX RDF	Image annotation refinement, graph algorithm, semantic similarity, MAX-CUT problem
24	Alan M. Frieze, Ravi Kannan	The Regularity Lemma and Approximation Schemes for Dense Problems.	FOCS	1996	DBLP DOI BibTeX RDF	dense problems, polynomial time approximation, dense graphs, Graph Bisection problem, Min l-way cut problem, Graph Separator problem, Max-SNP hard problems, graph theory, approximation schemes, Quadratic Assignment Problem, regularity lemma, Max Cut problem
24	David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001	Approximate Graph Coloring by Semidefinite Programming	FOCS	1994	DBLP DOI BibTeX RDF	approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio
22	Haiou Shen, Hantao Zhang 0001	Improving exact algorithms for MAX-2-SAT.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	exact algorithms, propositional satisfiability, maximum satisfiability
22	Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Algorithms Based on the Treewidth of Sparse Graphs.	WG	2005	DBLP DOI BibTeX RDF
22	Liming Cai, David W. Juedes	Subexponential Parameterized Algorithms Collapse the W-Hierarchy.	ICALP	2001	DBLP DOI BibTeX RDF
21	Michael Lampis, Georgia Kaouri, Valia Mitsou	On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures.	ISAAC	2008	DBLP DOI BibTeX RDF	Digraph decompositions, Treewidth, Parameterized Complexity
21	Michael A. Trick, Hakan Yildiz	A Large Neighborhood Search Heuristic for Graph Coloring.	CPAIOR	2007	DBLP DOI BibTeX RDF
21	Subhash Khot	Guest column: inapproximability results via Long Code based PCPs.	SIGACT News	2005	DBLP DOI BibTeX RDF
21	Iannis Tourlakis	Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
21	Uriel Feige, Michael Langberg	The RPR2 Rounding Technique for Semidefinite Programs.	ICALP	2001	DBLP DOI BibTeX RDF
19	Moein E. Samadi, Hedieh Mirzaieazar, Alexander Mitsos, Andreas Schuppert	Noisecut: a python package for noise-tolerant classification of binary data using prior knowledge integration and max-cut solutions.	BMC Bioinform.	2024	DBLP DOI BibTeX RDF
19	Suman Kumar Roy, Bhawana Rudra	Quantum-inspired hybrid algorithm for image classification and segmentation: Q-Means++ max-cut method.	Int. J. Imaging Syst. Technol.	2024	DBLP DOI BibTeX RDF
19	Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta 0001, Euiwoong Lee, Debmalya Panigrahi	Max-Cut with ε-Accurate Predictions.	CoRR	2024	DBLP DOI BibTeX RDF
19	Lunshan Gao	Finding local Max-Cut in graphs in randomized polynomial time.	Soft Comput.	2024	DBLP DOI BibTeX RDF
19	Robert J. Banks, Ehsan Haque, Farah Nazef, Fatima Fethallah, Fatima Ruqaya, Hamza Ahsan, Het Vora, Hibah Tahir, Ibrahim Ahmad, Isaac Hewins, Ishaq Shah, Krish Baranwal, Mannan Arora, Mateen Asad, Mubasshirah Khan, Nabian Hasan, Nuh Azad, Salgai Fedaiee, Shakeel Majeed, Shayam Bhuyan, Tasfia Tarannum, Yahya Ali, Dan E. Browne, P. A. Warburton	Continuous-time quantum walks for MAX-CUT are hot.	Quantum	2024	DBLP DOI BibTeX RDF
19	Eunok Bae, Soojoon Lee	Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs.	Quantum Inf. Process.	2024	DBLP DOI BibTeX RDF
19	Stefan Steinerberger	Max-Cut via Kuramoto-Type Oscillators.	SIAM J. Appl. Dyn. Syst.	2023	DBLP DOI BibTeX RDF
19	Timotej Hrga, Janez Povh	Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B.	Optim. Lett.	2023	DBLP DOI BibTeX RDF
19	Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis	MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems.	Algorithmica	2023	DBLP DOI BibTeX RDF
19	Renee Mirka, David P. Williamson	An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut.	ACM J. Exp. Algorithmics	2023	DBLP DOI BibTeX RDF
19	Xin Ye, Wenjia Zhang, Shaomeng Wang, Xiaoxuan Yang, Zuyuan He	20736-node weighted max-cut problem solving by quadrature photonic spatial Ising machine.	Sci. China Inf. Sci.	2023	DBLP DOI BibTeX RDF
19	Yifei Wang, Mert Pilanci	Polynomial-Time Solutions for ReLU Network Training: A Complexity Classification via Max-Cut and Zonotopes.	CoRR	2023	DBLP DOI BibTeX RDF
19	Lukas Michel, Alex Scott 0001	Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut.	CoRR	2023	DBLP DOI BibTeX RDF
19	Xin Ye, Wenjia Zhang, Shaomeng Wang, Xiaoxuan Yang, Zuyuan He	Photonic Spatial-Euler Ising Machine for Solving 20000-node Max-cut Problem.	CoRR	2023	DBLP DOI BibTeX RDF