Search results for "MAX-k-CUT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
75	Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners	On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	semidefiniteprogramming, Lovász -function, MAX-k-CUT, approximation algorithms, satisfiability, graph colouring
50	Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani	MAX k-CUT and Approximating the Chromatic Number of Random Graphs.	ICALP	2003	DBLP DOI BibTeX RDF
50	Alexander A. Ageev, Maxim Sviridenko	An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts.	ESA	2000	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
43	Gerold Jäger, Anand Srivastav	Improved Approximation Algorithms for Maximum Graph Partitioning Problems.	FSTTCS	2004	DBLP DOI BibTeX RDF
40	Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli	The capacitated max k -cut problem.	Math. Program.	2008	DBLP DOI BibTeX RDF
29	Daya Ram Gaur, Ramesh Krishnamurti	The Capacitated max-k-cut Problem.	ICCSA (4)	2005	DBLP DOI BibTeX RDF
28	Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka	A branch-and-cut algorithm for the connected max-k-cut problem.	Eur. J. Oper. Res.	2024	DBLP DOI BibTeX RDF
28	Alan M. Frieze, Mark Jerrum	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.	Algorithmica	1997	DBLP DOI BibTeX RDF
28	Alan M. Frieze, Mark Jerrum	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION.	IPCO	1995	DBLP DOI BibTeX RDF
27	Ola Angelsmark, Johan Thapper	Partitioning Based Algorithms for Some Colouring Problems.	CSCLP	2005	DBLP DOI BibTeX RDF
24	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
22	Gerold Jäger, Anand Srivastav	Improved Approximation Algorithms for Maximum Graph Partitioning Problems.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	maximum graph partitioning, semidefinite programming, approximation factor
21	Miroslaw Kalinowski, Alain Daurat, Gabor T. Herman	A Fast Construction of the Distance Graph Used for the Classification of Heterogeneous Electron Microscopic Projections.	GbRPR	2007	DBLP DOI BibTeX RDF
19	Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga	On relaxations of the max k-cut problem formulations.	Oper. Res. Lett.	2023	DBLP DOI BibTeX RDF
19	Karthekeyan Chandrasekaran, Weihang Wang 0002	Fixed parameter approximation scheme for min-max k-cut.	Math. Program.	2023	DBLP DOI BibTeX RDF
19	Sebastiano Corli, Daniele Dragoni, Massimiliano Proietti, Massimiliano Dispenza, Carlo Cavazzoni, Enrico Prati	A Max K-Cut Implementation for QAOA in the Measurement Based Quantum Computing Formalism.	QCE	2023	DBLP DOI BibTeX RDF
19	Martin Olsen	Oblivious Stacking and MAX k-CUT for Circle Graphs.	ICCL	2022	DBLP DOI BibTeX RDF
19	Franz G. Fuchs, Herman Øie Kolden, Niels Henrik Aase, Giorgio Sartor	Efficient Encoding of the Weighted MAX k-CUT on a Quantum Computer Using QAOA.	SN Comput. Sci.	2021	DBLP DOI BibTeX RDF
19	Christopher Hojny, Imke Joormann, Hendrik Lüthen, Martin Schmidt 0003	Mixed-integer programming techniques for the connected max-k-cut problem.	Math. Program. Comput.	2021	DBLP DOI BibTeX RDF
19	Cheng Lu 0007, Zhibin Deng	A branch-and-bound algorithm for solving max-k-cut problem.	J. Glob. Optim.	2021	DBLP DOI BibTeX RDF
19	Martin Olsen	Oblivious Stacking and MAX k-CUT for Circle Graphs.	CoRR	2021	DBLP BibTeX RDF
19	Wenbo Zeng, Yigang He, Bing Li 0006, Shudong Wang	Fractional pilot reuse and max k-cut based pilot decontamination scheme for multi-cell TDD massive MIMO systems.	IET Commun.	2021	DBLP DOI BibTeX RDF
19	Karthekeyan Chandrasekaran, Weihang Wang 0002	Fixed Parameter Approximation Scheme for Min-Max k-Cut.	IPCO	2021	DBLP DOI BibTeX RDF
19	Nimita Shinde, Vishnu Narayanan, James Saunderson	Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering.	NeurIPS	2021	DBLP BibTeX RDF
19	Karthekeyan Chandrasekaran, Weihang Wang 0002	Fixed Parameter Approximation Scheme for Min-max k-cut.	CoRR	2020	DBLP BibTeX RDF
19	Chiara Mocenni, Dario Madeo, Andrea Garuglieri, Simone Rinaldi, Giulia Palma	The Max k-Cut Game: On Stable Optimal Colorings.	CoRR	2020	DBLP BibTeX RDF
19	Miguel F. Anjos, José Neto	A class of spectral bounds for Max k-Cut.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
19	Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco	Coalition Resilient Outcomes in Max k-Cut Games.	SOFSEM	2019	DBLP DOI BibTeX RDF
19	Alantha Newman	Complex Semidefinite Programming and Max-k-Cut.	CoRR	2018	DBLP BibTeX RDF
19	Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco	Coalition Resilient Outcomes in Max k-Cut Games.	CoRR	2018	DBLP BibTeX RDF
19	Alantha Newman	Complex Semidefinite Programming and Max-k-Cut.	SOSA	2018	DBLP DOI BibTeX RDF
19	Fuda Ma, Jin-Kao Hao	A multiple search operator heuristic for the max-k-cut problem.	Ann. Oper. Res.	2017	DBLP DOI BibTeX RDF
19	Fuda Ma, Jin-Kao Hao	A Multiple Search Operator Heuristic for the Max-k-cut Problem.	CoRR	2015	DBLP BibTeX RDF
19	Mingliang Tao, Qimei Cui, Yateng Hong, Chong Yin, Hui Liang	Max K-CUT Based Clustering for Interference Mitigation and Traffic Adaptation in TDD Systems.	VTC Spring	2014	DBLP DOI BibTeX RDF
19	Wenxing Zhu, Geng Lin, M. Montaz Ali	Max-k-Cut by the Discrete Dynamic Convexized Method.	INFORMS J. Comput.	2013	DBLP DOI BibTeX RDF
19	Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli	Erratum to: The capacitated max k-cut problem.	Math. Program.	2011	DBLP DOI BibTeX RDF
19	Wenxing Zhu, Chuanyin Guo	A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph.	PAAP	2011	DBLP DOI BibTeX RDF
19	Béla Bollobás, Alex D. Scott	Max k-cut and judicious k-partitions.	Discret. Math.	2010	DBLP DOI BibTeX RDF
19	Laurent Gourvès, Jérôme Monnot	The Max k-Cut Game and Its Strong Equilibria.	TAMC	2010	DBLP DOI BibTeX RDF
19	Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani	MAX k-CUT and approximating the chromatic number of random graphs.	Random Struct. Algorithms	2006	DBLP DOI BibTeX RDF
19	Viggo Kann, Jens Lagergren, Alessandro Panconesi	Approximate Max k-Cut with Subgraph Guarantee.	Inf. Process. Lett.	1998	DBLP DOI BibTeX RDF
19	Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi	On the Hardness of Approximating Max k-Cut and its Dual.	Chic. J. Theor. Comput. Sci.	1997	DBLP BibTeX RDF
19	Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi	On the Hardness of Approximating Max k-Cut and Its Dual.	ISTCS	1996	DBLP BibTeX RDF
15	Jan Poland, Thomas Zeugmann	Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts.	Discovery Science	2006	DBLP DOI BibTeX RDF
11	Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi	Energy Efficient Monitoring in Sensor Networks.	LATIN	2008	DBLP DOI BibTeX RDF
11	Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan Zhou	Similarity-aware query allocation in sensor networks with multiple base stations.	DMSN	2007	DBLP DOI BibTeX RDF
11	Ioannis Giotis 0001, Venkatesan Guruswami	Correlation clustering with a fixed number of clusters.	SODA	2006	DBLP DOI BibTeX RDF
11	Mikko Koivisto	An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion.	FOCS	2006	DBLP DOI BibTeX RDF
11	Michael Langberg, Yuval Rabani, Chaitanya Swamy	Approximation Algorithms for Graph Homomorphism Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
11	Yici Cai, Bin Liu 0007, Qiang Zhou 0001, Xianlong Hong	Integrated routing resource assignment for RLC crosstalk minimization.	ISCAS (2)	2005	DBLP DOI BibTeX RDF
11	Refael Hassin, Shlomi Rubinstein	Approximation Algorithms for Maximum Linear Arrangement.	SWAT	2000	DBLP DOI BibTeX RDF