Search results for "max-cut"

Hits ?▲	Authors	Title	Venue	Year	Link
19	Gregory Schwartzman	Local Max-Cut on Sparse Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
19	Yu-Cheng Lin, Chuan-Chi Wang, Chia-Heng Tu, Shih-Hao Hung	Towards Optimizations of Quantum Circuit Simulation for Solving Max-Cut Problems with QAOA.	CoRR	2023	DBLP DOI BibTeX RDF
19	Redwan Ahmed Rizvee, Md. Mosaddek Khan	Understanding the Usage of QUBO-based Hamiltonian Function in Combinatorial Optimization over Graphs: A Discussion Using Max Cut (MC) Problem.	CoRR	2023	DBLP DOI BibTeX RDF
19	Robbie King	An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs.	Quantum	2023	DBLP DOI BibTeX RDF
19	Reuben Tate, Jai Moondra, Bryan Gard, Greg Mohler, Swati Gupta 0001	Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths.	Quantum	2023	DBLP DOI BibTeX RDF
19	Cheng Lu 0007, Zhibin Deng, Shu-Cherng Fang, Wenxun Xing	A New Global Algorithm for Max-Cut Problem with Chordal Sparsity.	J. Optim. Theory Appl.	2023	DBLP DOI BibTeX RDF
19	Lijie Chen 0001, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song 0002, Huacheng Yu	Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.	SODA	2023	DBLP DOI BibTeX RDF
19	Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson 0007, John Wright	Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality.	SODA	2023	DBLP DOI BibTeX RDF
19	Jun-Ting Hsieh, Pravesh K. Kothari	Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm.	ICALP	2023	DBLP DOI BibTeX RDF
19	Pablo Luiz Braga Soares, Carlos Victor Dantas Araújo	Genetic Algorithms with Optimality Cuts to the Max-Cut Problem.	BRACIS (3)	2023	DBLP DOI BibTeX RDF
19	Xiaoyu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer	Streaming Euclidean Max-Cut: Dimension vs Data Reduction.	STOC	2023	DBLP DOI BibTeX RDF
19	Chi Bach Pham, Wynita Griggs, James Saunderson	A Scalable Frank-Wolfe-Based Algorithm for the Max-Cut SDP.	ICML	2023	DBLP BibTeX RDF
19	Zhi-Zhong Zeng, Zhipeng Lü, Xin-Guo Yu, Qinghua Wu 0002, Yang Wang 0098, Zhou Zhou	A memetic algorithm based on edge-state learning for max-cut.	Expert Syst. Appl.	2022	DBLP DOI BibTeX RDF
19	Jonathan Bodine, Dorit S. Hochbaum	A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time.	SN Comput. Sci.	2022	DBLP DOI BibTeX RDF
19	Mathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile	Complexity and heuristics for the weighted max cut-clique problem.	Int. Trans. Oper. Res.	2022	DBLP DOI BibTeX RDF
19	Romain Ageron	Trigonometric approximation of the Max-Cut polytope is star-like.	Optim. Lett.	2022	DBLP DOI BibTeX RDF
19	Amin Coja-Oghlan, Philipp Loick, Balázs F. Mezei, Gregory B. Sorkin	The Ising Antiferromagnet and Max Cut on Random Regular Graphs.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
19	Mohamad Mahdi Mohades, Mohammad Hossein Kahaei	An Efficient Riemannian Gradient Based Algorithm for Max-Cut Problems.	IEEE Trans. Circuits Syst. II Express Briefs	2022	DBLP DOI BibTeX RDF
19	Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos	Generalised 2-circulant inequalities for the max-cut problem.	Oper. Res. Lett.	2022	DBLP DOI BibTeX RDF
19	Lijie Chen 0001, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song 0002, Huacheng Yu	Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.	Electron. Colloquium Comput. Complex.	2022	DBLP BibTeX RDF
19	Jun-Ting Hsieh, Pravesh K. Kothari	Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm.	CoRR	2022	DBLP DOI BibTeX RDF
19	Cem M. Unsal, Lucas T. Brady	Quantum Adversarial Learning in Emulation of Monte-Carlo Methods for Max-cut Approximation: QAOA is not optimal.	CoRR	2022	DBLP DOI BibTeX RDF
19	Stefan Boettcher	Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut.	CoRR	2022	DBLP DOI BibTeX RDF
19	John Kallaugher, Ojas Parekh	The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut.	CoRR	2022	DBLP DOI BibTeX RDF
19	Yu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer	Streaming Euclidean Max-Cut: Dimension vs Data Reduction.	CoRR	2022	DBLP DOI BibTeX RDF
19	Eiichiro Sato	Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs.	CoRR	2022	DBLP BibTeX RDF
19	Javier Villalba-Diez, Ana González-Marcos, Joaquín B. Ordieres Meré	Improvement of Quantum Approximate Optimization Algorithm for Max-Cut Problems.	Sensors	2022	DBLP DOI BibTeX RDF
19	Nico Bertram, Jonas Ellert, Johannes Fischer 0001	High-Quality Parallel Max-Cut Approximation Algorithms forShared Memory.	Mach. Learn. under Resour. Constraints Vol. 1 (1)	2022	DBLP DOI BibTeX RDF
19	Jittat Fakcharoenphol, Phanu Vajanopath	MAX-CUT on Samplings of Dense Graphs.	JCSSE	2022	DBLP DOI BibTeX RDF
19	Renee Mirka, David P. Williamson	An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut.	SEA	2022	DBLP DOI BibTeX RDF
19	John Kallaugher, Ojas Parekh	The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut.	FOCS	2022	DBLP DOI BibTeX RDF
19	Utkarsh Joshi, Saladi Rahul, Josson Joe Thoppil	A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs.	FSTTCS	2022	DBLP DOI BibTeX RDF
19	Timotej Hrga, Janez Povh	MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM.	Comput. Optim. Appl.	2021	DBLP DOI BibTeX RDF
19	Shafi Md Kawsar Zaman, Xiaodong Liang, Weixing Li	Fault Diagnosis for Variable Frequency Drive-Fed Induction Motors Using Wavelet Packet Decomposition and Greedy-Gradient Max-Cut Learning.	IEEE Access	2021	DBLP DOI BibTeX RDF
19	Ali Bibak, Charles Carlson 0002, Karthekeyan Chandrasekaran	Improving the Smoothed Complexity of FLIP for Max Cut Problems.	ACM Trans. Algorithms	2021	DBLP DOI BibTeX RDF
19	Viet Hung Nguyen, Michel Minoux	Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results.	Optim. Lett.	2021	DBLP DOI BibTeX RDF
19	Charles Carlson 0002, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan	Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
19	Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling	Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
19	Refael Hassin, Nikita Leshenko	Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem.	Oper. Res. Lett.	2021	DBLP DOI BibTeX RDF
19	Wenkai Xu, Gang Niu 0001, Aapo Hyvärinen, Masashi Sugiyama	Direction Matters: On Influence-Preserving Graph Summarization and Max-Cut Principle for Directed Graphs.	Neural Comput.	2021	DBLP DOI BibTeX RDF
19	Sami Boulebnane, Ashley Montanaro	Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit.	CoRR	2021	DBLP BibTeX RDF
19	Matthew B. Hastings	A Classical Algorithm Which Also Beats 1/2 + 2/π 1/√D For High Girth MAX-CUT.	CoRR	2021	DBLP BibTeX RDF
19	Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian	Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT.	CoRR	2021	DBLP BibTeX RDF
19		A Faster Algorithm for Max Cut in Dense Graphs.	CoRR	2021	DBLP BibTeX RDF
19	Keren Censor-Hillel, Noa Marelly, Roy Schwartz 0002, Tigran Tonoyan	Fault Tolerant Max-Cut.	CoRR	2021	DBLP BibTeX RDF
19	Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson 0007, John Wright	Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality.	CoRR	2021	DBLP BibTeX RDF
19		Efficiently Solve the Max-cut Problem via a Quantum Qubit Rotation Algorithm.	CoRR	2021	DBLP BibTeX RDF
19	Stefan Steinerberger	Max-Cut via Kuramoto-type Oscillators.	CoRR	2021	DBLP BibTeX RDF
19	Ritajit Majumdar, Dhiraj Madan, Debasmita Bhoumik, Dhinakaran Vinayagamurthy, Shesha Raghunathan, Susmita Sur-Kolay	Optimizing Ansatz Design in QAOA for Max-cut.	CoRR	2021	DBLP BibTeX RDF
19	Ritajit Majumdar, Debasmita Bhoumik, Dhiraj Madan, Dhinakaran Vinayagamurthy, Shesha Raghunathan, Susmita Sur-Kolay	Depth Optimized Ansatz Circuit in QAOA for Max-Cut.	CoRR	2021	DBLP BibTeX RDF
19	Kunal Marwaha	Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs.	Quantum	2021	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.	ISAAC	2021	DBLP DOI BibTeX RDF
19	Karlheinz Ochs, Bakr Al Beattie, Sebastian Jenderny	An Ising Machine Solving Max-Cut Problems based on the Circuit Synthesis of the Phase Dynamics of a Modified Kuramoto Model.	MWSCAS	2021	DBLP DOI BibTeX RDF
19	Keren Censor-Hillel, Noa Marelly, Roy Schwartz 0002, Tigran Tonoyan	Fault Tolerant Max-Cut.	ICALP	2021	DBLP DOI BibTeX RDF
19	Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian	Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT.	AISTATS	2021	DBLP BibTeX RDF
19	Angel E. Rodriguez-Fernandez	On the Study of Fitness Landscapes and the Max-Cut Problem		2021	RDF
19	Shafi Md Kawsar Zaman, Xiaodong Liang, Lihong Zhang	Greedy-Gradient Max Cut-Based Fault Diagnosis for Direct Online Induction Motors.	IEEE Access	2020	DBLP DOI BibTeX RDF
19	Qingzhi Yang, Yiyong Li, Pengfei Huang	A novel formulation of the max-cut problem and related algorithm.	Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
19	Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi	Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree.	Theory Comput. Syst.	2020	DBLP DOI BibTeX RDF
19	Angel E. Rodriguez-Fernandez, Bernardo A. Gonzalez-Torres, Ricardo Menchaca-Mendez, Peter F. Stadler	Clustering Improves the Goemans-Williamson Approximation for the Max-Cut Problem.	Comput.	2020	DBLP DOI BibTeX RDF
19	Florian Jarre, Felix Lieder, Ya-Feng Liu, Cheng Lu 0007	Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting.	J. Glob. Optim.	2020	DBLP DOI BibTeX RDF
19	Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu	Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems.	CoRR	2020	DBLP BibTeX RDF
19	Jonathan Bodine, Dorit S. Hochbaum	The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees.	CoRR	2020	DBLP BibTeX RDF
19	Amin Coja-Oghlan, Philipp Loick, Balázs F. Mezei, Gregory B. Sorkin	The Ising antiferromagnet and max cut on random regular graphs.	CoRR	2020	DBLP 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.	CoRR	2020	DBLP BibTeX RDF
19	Mohammad Khairul Bashar, Antik Mallick, Daniel S. Truesdell, Benton H. Calhoun, Siddharth Joshi, Nikhil Shukla	Experimental Demonstration of a Reconfigurable Coupled Oscillator Platform to Solve the Max-Cut Problem.	CoRR	2020	DBLP BibTeX RDF
19	Elisabeth Gaar, Franz Rendl	A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring.	Math. Program.	2020	DBLP DOI BibTeX RDF
19	Brahim Chaourar	Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$.	J. Comb. Optim.	2020	DBLP DOI BibTeX RDF
19	Anurag Anshu, David Gosset, Karen Morenz	Beyond Product State Approximations for a Quantum Analogue of Max Cut.	TQC	2020	DBLP DOI BibTeX RDF
19	Giovanna Fortez, Franco Robledo, Pablo Romero, Omar Viera	A Fast Genetic Algorithm for the Max Cut-Clique Problem.	LOD (1)	2020	DBLP DOI BibTeX RDF
19	Samuel B. Hopkins, Tselil Schramm, Luca Trevisan	Subexponential LPs Approximate Max-Cut.	FOCS	2020	DBLP DOI BibTeX RDF
19	Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu	Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems.	FOCS	2020	DBLP DOI BibTeX RDF
19	Dimitris Fotakis 0001, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis	Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games.	ICALP	2020	DBLP DOI BibTeX RDF
19	Jonathan Bodine, Dorit S. Hochbaum	The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees.	KDIR	2020	DBLP DOI BibTeX RDF
19	Charles Carlson 0002, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan	Lower Bounds for Max-Cut via Semidefinite Programming.	LATIN	2020	DBLP DOI BibTeX RDF
19	Omer Wasim, Valerie King	Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT.	FSTTCS	2020	DBLP DOI BibTeX RDF
19	Chase Cook, Hengyang Zhao, Takashi Sato, Masayuki Hiromoto, Sheldon X.-D. Tan	GPU-based Ising computing for solving max-cut combinatorial optimization problems.	Integr.	2019	DBLP DOI BibTeX RDF
19	Wenkai Xu, Gang Niu 0001, Aapo Hyvärinen, Masashi Sugiyama	Direction Matters: On Influence-Preserving Graph Summarization and Max-cut Principle for Directed Graphs.	CoRR	2019	DBLP BibTeX RDF
19	Weichi Yao, Afonso S. Bandeira, Soledad Villar	Experimental performance of graph neural networks on random instances of max-cut.	CoRR	2019	DBLP BibTeX RDF
19	Yasuaki Kobayashi, Yusuke Kobayashi 0001, Shuichi Miyazaki, Suguru Tamaki	An FPT Algorithm for Max-Cut Parameterized by Crossing Number.	CoRR	2019	DBLP BibTeX RDF
19	Samuel B. Hopkins, Tselil Schramm, Luca Trevisan	Subexponential LPs Approximate Max-Cut.	CoRR	2019	DBLP BibTeX RDF
19	Dimitris Fotakis 0001, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis	Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games.	CoRR	2019	DBLP BibTeX RDF
19	Sevag Gharibian, Ojas Parekh	Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut.	CoRR	2019	DBLP BibTeX RDF
19	Brahim Chaourar	Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor.	CoRR	2019	DBLP BibTeX RDF
19		Max-Cut in Degenerate H-Free Graphs.	CoRR	2019	DBLP BibTeX RDF
19	Yong-Hyuk Kim, Yourim Yoon, Zong Woo Geem	A comparison study of harmony search and genetic algorithm for the max-cut problem.	Swarm Evol. Comput.	2019	DBLP DOI BibTeX RDF
19	Ali Bibak, Charles Carlson 0002, Karthekeyan Chandrasekaran	Improving the smoothed complexity of FLIP for max cut problems.	SODA	2019	DBLP DOI BibTeX RDF
19	Da-Ren Chen, Hao-Yen Chang, Ye-Zheng Chen	Max-cut and min-flow theorem for coal-transportation networks based on fault-tolerant routing.	ITNAC	2019	DBLP DOI BibTeX RDF
19	Jan-Hendrik Lange, Bjoern Andres, Paul Swoboda	Combinatorial Persistency Criteria for Multicut and Max-Cut.	CVPR	2019	DBLP BibTeX RDF
19	Xiang Chen, Geng Lin, Meiqin Xu	Applying a binary artificial bee colony algorithm to the max-cut problem.	CISP-BMEI	2019	DBLP DOI BibTeX RDF
19	Yasuaki Kobayashi, Yusuke Kobayashi 0001, Shuichi Miyazaki, Suguru Tamaki	An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number.	IWOCA	2019	DBLP DOI BibTeX RDF
19	Michael Kapralov, Dmitry Krachun	An optimal space lower bound for approximating MAX-CUT.	STOC	2019	DBLP DOI BibTeX RDF
19	Sevag Gharibian, Ojas Parekh	Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.	APPROX-RANDOM	2019	DBLP DOI BibTeX RDF
19	Iain Dunning, Swati Gupta 0001, John Silberholz	What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO.	INFORMS J. Comput.	2018	DBLP DOI BibTeX RDF
19	Yu Xiu, Weiwei Shen, Zhongqun Wang, Sanmin Liu, Jun Wang 0006	Multiple graph regularized graph transduction via greedy gradient Max-Cut.	Inf. Sci.	2018	DBLP DOI BibTeX RDF
19	Saket Saurabh 0001, Meirav Zehavi	$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel.	Algorithmica	2018	DBLP DOI BibTeX RDF
19	Konstantinos Kaparis, Adam N. Letchford	A note on the 2-circulant inequalities for the max-cut problem.	Oper. Res. Lett.	2018	DBLP DOI BibTeX RDF
19	Martin Koutecký, Jon Lee 0001, Viswanath Nagarajan, Xiangkun Shen	Approximating max-cut under graph-MSO constraints.	Oper. Res. Lett.	2018	DBLP DOI BibTeX RDF
19	Young Kun Ko	On Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG.	Electron. Colloquium Comput. Complex.	2018	DBLP BibTeX RDF
19	Christine Dahn, Nils M. Kriege, Petra Mutzel	A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.	CoRR	2018	DBLP BibTeX RDF