The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1981-1994 (20) 1995-1997 (15) 1998-2000 (16) 2001-2002 (26) 2003-2004 (19) 2005 (16) 2006 (22) 2007 (17) 2008-2009 (30) 2010-2011 (16) 2012 (19) 2013-2015 (21) 2016 (15) 2017-2018 (35) 2019 (19) 2020 (22) 2021 (24) 2022 (23) 2023 (23) 2024 (6)
Publication types (Num. hits)
article(229) incollection(6) inproceedings(165) phdthesis(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 126 occurrences of 83 keywords

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