Search results for "max-cut"

Hits ?▲	Authors	Title	Venue	Year	Link
19	Charles Carlson 0002, Alexandra Kolla, Luca Trevisan	A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs.	CoRR	2018	DBLP 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.	CoRR	2018	DBLP BibTeX RDF
19	Ali Bibak, Charles Carlson 0002, Karthekeyan Chandrasekaran	Improving the smoothed complexity of FLIP for max cut problems.	CoRR	2018	DBLP BibTeX RDF
19	Gian Giacomo Guerreschi, Anne Y. Matsuura	QAOA for Max-Cut requires hundreds of qubits for quantum speed-up.	CoRR	2018	DBLP BibTeX RDF
19	Michael Kapralov, Dmitry Krachun	An Optimal Space Lower Bound for Approximating MAX-CUT.	CoRR	2018	DBLP BibTeX RDF
19	Martin Koutecký, Jon Lee 0001, Viswanath Nagarajan, Xiangkun Shen	Approximating Max-Cut under Graph-MSO Constraints.	CoRR	2018	DBLP BibTeX RDF
19	Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari	Near-optimal approximation algorithm for simultaneous Max-Cut.	CoRR	2018	DBLP BibTeX RDF
19	Xiangkun Shen, Jon Lee 0001, Viswanath Nagarajan	Approximating graph-constrained max-cut.	Math. Program.	2018	DBLP DOI BibTeX RDF
19	Nasim Samei, Roberto Solis-Oba	A local search algorithm for the constrained max cut problem on hypergraphs.	PeerJ Prepr.	2018	DBLP DOI BibTeX RDF
19	David Gamarnik, Quan Li 0001	On the max-cut of sparse random graphs.	Random Struct. Algorithms	2018	DBLP DOI BibTeX RDF
19	Mathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile	Complexity and Heuristics for the Max Cut-Clique Problem.	ICVNS	2018	DBLP DOI BibTeX RDF
19	Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari	Near-optimal approximation algorithm for simultaneous Max-Cut.	SODA	2018	DBLP DOI BibTeX RDF
19	Mathias Bourel, Eduardo A. Canale, Franco Robledo, Pablo Romero, Luis Stábile	A GRASP/VND Heuristic for the Max Cut-Clique Problem.	LOD	2018	DBLP DOI BibTeX RDF
19	Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi	Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.	CSR	2018	DBLP DOI BibTeX RDF
19	Christine Dahn, Nils M. Kriege, Petra Mutzel	A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.	IWOCA	2018	DBLP DOI BibTeX RDF
19	Shenshen Gu, Yue Yang	A Pointer Network Based Deep Learning Algorithm for the Max-Cut Problem.	ICONIP (1)	2018	DBLP DOI BibTeX RDF
19	Michael Etscheid	Beyond Worst-Case Analysis of Max-Cut and Local Search		2018	RDF
19	Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira	Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.	Discret. Math. Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
19	Brahim Chaourar	A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs.	Adv. Oper. Res.	2017	DBLP DOI BibTeX RDF
19	Sebastian M. Cioaba, Jacobus H. Koolen, Weiqiang Li 0002	Max-cut and extendability of matchings in distance-regular graphs.	Eur. J. Comb.	2017	DBLP DOI BibTeX RDF
19	Keren Censor-Hillel, Rina Levy, Hadas Shachnai	Fast Distributed Approximation for Max-Cut.	CoRR	2017	DBLP BibTeX RDF
19	Michael Kapralov, Sanjeev Khanna, Madhu Sudan 0001, Ameya Velingker	(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space.	SODA	2017	DBLP DOI BibTeX RDF
19	Li-Yuan Xue, Rong-Qiang Zeng, Zheng-Yin Hu, Yi Wen 0007	Solving the Bi-criteria Max-Cut Problem with Different Neighborhood Combination Strategies.	IDEAL	2017	DBLP DOI BibTeX RDF
19	Yingying Xu, Zhihua Cui, Lifang Wang	Discrete Cuckoo Search with Local Search for Max-cut Problem.	IFIP TC12 ICIS	2017	DBLP DOI BibTeX RDF
19	Keren Censor-Hillel, Rina Levy, Hadas Shachnai	Fast Distributed Approximation for Max-Cut.	ALGOSENSORS	2017	DBLP DOI BibTeX RDF
19	Omer Angel, Sébastien Bubeck, Yuval Peres, Fan Wei	Local max-cut in smoothed polynomial time.	STOC	2017	DBLP DOI BibTeX RDF
19	Li-Yuan Xue, Rong-Qiang Zeng, Haiyun Xu, Zheng-Yin Hu, Yi Wen 0007	Hypervolume-Based Multi-level Algorithm for the Bi-criteria Max-Cut Problem.	BIC-TA	2017	DBLP DOI BibTeX RDF
19	Alantha Newman	Max Cut.	Encyclopedia of Algorithms	2016	DBLP DOI BibTeX RDF
19	Mark Jones 0001	Kernelization, Max-Cut Above Tight Bounds.	Encyclopedia of Algorithms	2016	DBLP DOI BibTeX RDF
19	Rafael Veiga Pocai	The Complexity of SIMPLE MAX-CUT on Comparability Graphs.	Electron. Notes Discret. Math.	2016	DBLP DOI BibTeX RDF
19	Jean B. Lasserre	A MAX-CUT formulation of 0/1 programs.	Oper. Res. Lett.	2016	DBLP DOI BibTeX RDF
19	Omer Angel, Sébastien Bubeck, Yuval Peres, Fan Wei	Local max-cut in smoothed polynomial time.	CoRR	2016	DBLP BibTeX RDF
19	Maria-Florina Balcan, Vaishnavh Nagarajan, Ellen Vitercik, Colin White	Learning the best algorithm for max-cut, clustering, and other partitioning problems.	CoRR	2016	DBLP BibTeX RDF
19	Mikael Gast, Mathias Hauptmann, Marek Karpinski	Approximation Complexity of Max-Cut on Power Law Graphs.	CoRR	2016	DBLP BibTeX RDF
19	Yariv Aizenbud, Yoel Shkolnisky	A max-cut approach to heterogeneity in cryo-electron microscopy.	CoRR	2016	DBLP BibTeX RDF
19	Brahim Chaourar	A linear time algorithm for a variant of the max cut problem in series parallel graphs.	CoRR	2016	DBLP BibTeX RDF
19	Geng Lin, Jian Guan 0007	An Integrated Method Based on PSO and EDA for the Max-Cut Problem.	Comput. Intell. Neurosci.	2016	DBLP DOI BibTeX RDF
19	Jon Lee 0001, Viswanath Nagarajan, Xiangkun Shen	Max-Cut Under Graph Constraints.	IPCO	2016	DBLP DOI BibTeX RDF
19	Derkaoui Orkia, Ahmed Lehireche	Solving the max-cut problem using semidefinite optimization.	CIST	2016	DBLP DOI BibTeX RDF
19	Saket Saurabh 0001, Meirav Zehavi	(k, n-k)-Max-Cut: An ∗(2p)-Time Algorithm and a Polynomial Kernel.	LATIN	2016	DBLP DOI BibTeX RDF
19	Geng Lin, Wenxing Zhu	A memetic algorithm for the max-cut problem.	Int. J. Comput. Sci. Math.	2015	DBLP DOI BibTeX RDF
19	José A. Soto	Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning.	SIAM J. Discret. Math.	2015	DBLP DOI BibTeX RDF
19	Robert Crowston, Mark Jones 0001, Matthias Mnich	Max-Cut Parameterized Above the Edwards-Erdős Bound.	Algorithmica	2015	DBLP DOI BibTeX RDF
19	Jon Lee 0001, Viswanath Nagarajan, Xiangkun Shen	Max-Cut under Graph Constraints.	CoRR	2015	DBLP BibTeX RDF
19	Sebastian M. Cioaba, Jack H. Koolen, Weiqiang Li 0002	Max-cut and extendability of matchings in distance-regular graphs.	CoRR	2015	DBLP BibTeX RDF
19	Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira	Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.	CoRR	2015	DBLP BibTeX RDF
19	Qinghua Wu 0002, Yang Wang 0030, Zhipeng Lü	A tabu search based hybrid evolutionary algorithm for the max-cut problem.	Appl. Soft Comput.	2015	DBLP DOI BibTeX RDF
19	Michael Kapralov, Sanjeev Khanna, Madhu Sudan 0001	Streaming Lower Bounds for Approximating MAX-CUT.	SODA	2015	DBLP DOI BibTeX RDF
19	Fredrik D. Johansson, Ankani Chattoraj, Chiranjib Bhattacharyya, Devdatt P. Dubhashi	Weighted Theta Functions and Embeddings with Applications to Max-Cut, Clustering and Summarization.	NIPS	2015	DBLP BibTeX RDF
19	Ming Yang 0001, Bo Liu 0004, Wei Wang 0089, Junzhou Luo, Xiaojun Shen 0002	Maximum Capacity Overlapping Channel Assignment Based on Max-Cut in 802.11 Wireless Mesh Networks.	J. Univers. Comput. Sci.	2014	DBLP DOI BibTeX RDF
19	Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001, Ondrej Suchý	Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.	J. Comput. Syst. Sci.	2014	DBLP DOI BibTeX RDF
19	Michael Kapralov, Sanjeev Khanna, Madhu Sudan 0001	Streaming Lower Bounds for Approximating MAX-CUT.	CoRR	2014	DBLP BibTeX RDF
19	Nathan Krislock, Jérôme Malick, Frédéric Roupin	Improved semidefinite bounding procedure for solving Max-Cut problems to optimality.	Math. Program.	2014	DBLP DOI BibTeX RDF
19	Jun Wang 0006, Tony Jebara, Shih-Fu Chang	Semi-supervised learning using greedy max-cut.	J. Mach. Learn. Res.	2013	DBLP BibTeX RDF
19	Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan	Bilu-Linial Stable Instances of Max Cut	CoRR	2013	DBLP BibTeX RDF
19	Gary A. Kochenberger, Jin-Kao Hao, Zhipeng Lü, Haibo Wang 0001, Fred W. Glover	Solving large scale Max Cut problems via tabu search.	J. Heuristics	2013	DBLP DOI BibTeX RDF
19	Samuel de Sousa 0001, Yll Haxhimusa, Walter G. Kropatsch	Estimation of Distribution Algorithm for the Max-Cut Problem.	GbRPR	2013	DBLP DOI BibTeX RDF
19	Wei Wang 0089, Bo Liu 0004, Ming Yang 0001, Junzhou Luo, Xiaojun Shen	Max-Cut based overlapping channel assignment for 802.11 multi-radio wireless mesh networks.	CSCWD	2013	DBLP DOI BibTeX RDF
19	David Auger, Johanne Cohen, Pierre Coucheney, Lise Rodier	Distributed Selfish Algorithms for the Max-Cut Game.	ISCIS	2013	DBLP DOI BibTeX RDF
19	Paul M. Bodily, Mark J. Clement, Quinn Snell, Jared C. Price, Stanley Fujimoto, Nozomu Okuda	Application of a MAX-CUT Heuristic to the Contig Orientation Problem in Genome Assembly.	BCB	2013	DBLP DOI BibTeX RDF
19	Geng Lin, Wenxing Zhu	A discrete dynamic convexized method for the max-cut problem.	Ann. Oper. Res.	2012	DBLP DOI BibTeX RDF
19	Frauke Liers, G. Pardella	Partitioning planar graphs: a fast combinatorial approach for max-cut.	Comput. Optim. Appl.	2012	DBLP DOI BibTeX RDF
19	Marcin Kaminski 0001	max-cut and containment relations in graphs.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
19	Laura Galli, Konstantinos Kaparis, Adam N. Letchford	Complexity results for the gap inequalities for the max-cut problem.	Oper. Res. Lett.	2012	DBLP DOI BibTeX RDF
19	Alexander Lange, Stanislaw P. Radziszowski, Xiaodong Xu 0006	Use of MAX-CUT for Ramsey Arrowing of Triangles	CoRR	2012	DBLP BibTeX RDF
19	Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001, Ondrej Suchý	Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound	CoRR	2012	DBLP BibTeX RDF
19	Ai-fan Ling, Cheng-Xian Xu	A new discrete filled function method for solving large scale max-cut problems.	Numer. Algorithms	2012	DBLP DOI BibTeX RDF
19	Luigi Grippo, Laura Palagi, Mauro Piacentini, Veronica Piccialli, Giovanni Rinaldi	SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances.	Math. Program.	2012	DBLP DOI BibTeX RDF
19	Luca Trevisan	Max Cut and the Smallest Eigenvalue.	SIAM J. Comput.	2012	DBLP DOI BibTeX RDF
19	Kisung Seo, Soohwan Hyun, Yong-Hyuk Kim	A Spanning Tree-Based Encoding of the MAX CUT Problem for Evolutionary Search.	PPSN (1)	2012	DBLP DOI BibTeX RDF
19	Qinghua Wu 0002, Jin-Kao Hao	A Memetic Approach for the Max-Cut Problem.	PPSN (2)	2012	DBLP DOI BibTeX RDF
19	Hervé Daudé, Conrado Martínez, Vonjy Rasendrahasina, Vlady Ravelomanana	The MAX-CUT of sparse random graphs.	SODA	2012	DBLP DOI BibTeX RDF
19	Robert Crowston, Mark Jones 0001, Matthias Mnich	Max-Cut Parameterized above the Edwards-Erdős Bound.	ICALP (1)	2012	DBLP DOI BibTeX RDF
19	Laura Galli, Konstantinos Kaparis, Adam N. Letchford	Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm.	ISCO	2012	DBLP DOI BibTeX RDF
19	Geng Lin	A PROBE-based algorithm for the max-cut problem.	ICNC	2012	DBLP DOI BibTeX RDF
19	Bo Song, Victor O. K. Li	A hybridization between memetic algorithm and semidefinite relaxation for the max-cut problem.	GECCO	2012	DBLP DOI BibTeX RDF
19	Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh 0001	New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting.	LATIN	2012	DBLP DOI BibTeX RDF
19	Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001, Ondrej Suchý	Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.	FSTTCS	2012	DBLP DOI BibTeX RDF
19	Tobias Tscheuschner	The complexity of local max-cut		2012	RDF
19	Giuseppe Lancia, Paolo Serafini	An effective compact formulation of the max cut problem on sparse graphs.	Electron. Notes Discret. Math.	2011	DBLP DOI BibTeX RDF
19	Mariano Zelke	Intractability of min- and max-cut in streaming graphs.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
19	Myoung-Ju Park, Sung-Pil Hong	Rank of Handelman hierarchy for Max-Cut.	Oper. Res. Lett.	2011	DBLP DOI BibTeX RDF
19	Robert Crowston, Mark Jones 0001, Matthias Mnich	Max-Cut Parameterized Above the Edwards-Erdős Bound	CoRR	2011	DBLP BibTeX RDF
19	Volodymyr Shylo, Oleg V. Shylo	Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search.	Int. J. Swarm Intell. Res.	2011	DBLP DOI BibTeX RDF
19	Mark D. M. Leiserson, Diana Tatar, Lenore J. Cowen, Benjamin J. Hescott	Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut.	J. Comput. Biol.	2011	DBLP DOI BibTeX RDF
19	Mark D. M. Leiserson, Diana Tatar, Lenore J. Cowen, Benjamin J. Hescott	Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut.	RECOMB	2011	DBLP DOI BibTeX RDF
19	Robert Elsässer, Tobias Tscheuschner	Settling the Complexity of Local Max-Cut (Almost) Completely.	ICALP (1)	2011	DBLP DOI BibTeX RDF
19	Thorsten Bonato	Contraction-based Separation and Lifting for Solving the Max-Cut Problem (PDF / PS)		2011	RDF
19		Polynomial complexity algorithm for Max-Cut problem	CoRR	2010	DBLP BibTeX RDF
19	Tobias Tscheuschner	The local max-cut problem is PLS-complete even on graphs with maximum degree five	CoRR	2010	DBLP BibTeX RDF
19	Feng Xie, Yi Shen, Xiaofei He 0001	K-way min-max cut for image clustering and junk images filtering from Google images.	ACM Multimedia	2010	DBLP DOI BibTeX RDF
19	Marcin Kaminski 0001	max-cut and Containment Relations in Graphs.	WG	2010	DBLP DOI BibTeX RDF
19	Burkhard Monien, Tobias Tscheuschner	On the Power of Nodes of Degree Four in the Local Max-Cut Problem.	CIAC	2010	DBLP DOI BibTeX RDF
19	Fengmin Xu, Chengxian Xu, Jiuquan Ren	A Continuation Approach Using NCP Function for Solving Max-Cut Problem.	Asia Pac. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
19	Rafael Martí, Abraham Duarte, Manuel Laguna	Advanced Scatter Search for the Max-Cut Problem.	INFORMS J. Comput.	2009	DBLP DOI BibTeX RDF
19	Manuel Laguna, Abraham Duarte, Rafael Martí	Hybridizing the cross-entropy method: An application to the max-cut problem.	Comput. Oper. Res.	2009	DBLP DOI BibTeX RDF
19	Subhash Khot, Ryan O'Donnell	SDP Gaps and UGC-hardness for Max-Cut-Gain.	Theory Comput.	2009	DBLP DOI BibTeX RDF
19	Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer	Subsampling Semidefinite Programs and Max-Cut on the Sphere.	Electron. Colloquium Comput. Complex.	2009	DBLP BibTeX RDF
19	José A. Soto	Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning	CoRR	2009	DBLP BibTeX RDF
19	Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer	Subsampling Semidefinite Programs and Max-Cut on the Sphere	CoRR	2009	DBLP BibTeX RDF