The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase MAX-k-CUT (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1995-2005 (15) 2006-2013 (15) 2014-2021 (17) 2022-2024 (5)
Publication types (Num. hits)
article(25) inproceedings(27)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 19 occurrences of 17 keywords

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