Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
99 | Philip N. Klein, Hsueh-I Lu |
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 387-396, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
99 | Jun Dong Cho, Salil Raje, Majid Sarrafzadeh |
Approximation Algorithm on Multi-Way Maxcut Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 148-158, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
62 | Garud Iyengar, David J. Phillips, Clifford Stein 0001 |
Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, pp. 152-166, 2005, Springer, 3-540-26199-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
62 | Steven Homer, Marcus Peinado |
A highly parallel algorithm to approximate MaxCut on distributed memory architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 113-117, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
MaxCut, maximum weight cut, weighted undirected graph, linear speedup, parallel algorithms, parallel algorithm, graph theory, distributed memory systems, distributed memory architectures, Connection Machine |
55 | Alberto Bertoni, Paola Campadelli, Roberto Posenato |
An Upper Bound for the Maximum Cut Mean Value. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 78-84, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
44 | Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu |
Linear programming relaxations of maxcut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 53-61, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
44 | Andreas Björklund |
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 839-849, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Thomas Hofmeister, Hanno Lefmann |
A Combinatorial Design Approach to MAXCUT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 441-452, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
37 | Subhash Khot, Ryan O'Donnell |
SDP gaps and UGC-hardness for MAXCUTGAIN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 217-226, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Vorapong Suppakitpaisarn, Jin-Kao Hao |
Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.13004, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Reuben Tate, Stephan J. Eidenbenz |
Guarantees on Warm-Started QAOA: Single-Round Approximation Ratios for 3-Regular MAXCUT and Higher-Round Scaling Limits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.12631, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Daniel Rehfeldt, Thorsten Koch, Yuji Shinano |
Faster exact solution of sparse MaxCut and QUBO problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. Comput. ![In: Math. Program. Comput. 15(3), pp. 445-470, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Rizwanul Alam, George Siopsis, Rebekah Herrman, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble |
Solving MaxCut with quantum imaginary time evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 22(7), pp. 281, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001 |
MaxCut on permutation graphs is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 104(1), pp. 5-16, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Ivan Bliznets, Vladislav Epifanov |
MaxCut Above Guarantee. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, pp. 22:1-22:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-292-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Bradley H. Theilman, Yipu Wang, Ojas Parekh, William Severa, J. Darby Smith, James B. Aimone |
Stochastic Neuromorphic Circuits for Solving MAXCUT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2023, St. Petersburg, FL, USA, May 15-19, 2023, pp. 779-787, 2023, IEEE, 979-8-3503-3766-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Bradley H. Theilman, James B. Aimone |
Goemans-Williamson MAXCUT approximation algorithm on Loihi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NICE ![In: Neuro-Inspired Computational Elements Conference, NICE2023, San Antonio, TX, USA, April 11-14, 2023., pp. 1-5, 2023, ACM, 978-1-4503-9947-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Daniel Rehfeldt, Thorsten Koch, Yuji Shinano |
Faster exact solution of sparse MaxCut and QUBO problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.02305, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
26 | Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001 |
MaxCut on Permutation Graphs is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.13955, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
26 | Bradley H. Theilman, Yipu Wang, Ojas D. Parekh, William Severa, J. Darby Smith, James B. Aimone |
Stochastic Neuromorphic Circuits for Solving MAXCUT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.02588, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Lis Arufe, Miguel A. González 0001, Angelo Oddi, Riccardo Rasconi, Ramiro Varela |
Quantum circuit compilation by genetic algorithm for quantum approximate optimization algorithm applied to MaxCut problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Swarm Evol. Comput. ![In: Swarm Evol. Comput. 69, pp. 101030, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, Leo Zhou |
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TQC ![In: 17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA., pp. 7:1-7:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-237-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Jessica K. Thompson, Ojas Parekh, Kunal Marwaha |
An explicit vector algorithm for high-girth MaxCut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022, pp. 238-246, 2022, SIAM, 978-1-61197-706-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Jan Kratochvíl, Tomás Masarík, Jana Novotná 0001 |
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(12), pp. 3649-3680, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, Leo Zhou |
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.14206, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
26 | Stefan Steinerberger |
A 0.502·MaxCut Approximation using Quadratic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.14404, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
26 | Jessica K. Thompson, Ojas Parekh, Kunal Marwaha |
An explicit vector algorithm for high-girth MaxCut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.12477, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
26 | Rebekah Herrman, Lorna Treffert, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble, George Siopsis |
Impact of graph structures for QAOA on MaxCut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 20(8), pp. 289, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Jan Kratochvíl, Tomás Masarík, Jana Novotná 0001 |
U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.08311, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
26 | Jan Kratochvíl, Tomás Masarík, Jana Novotná 0001 |
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic., pp. 57:1-57:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-159-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Marcel Kenji de Carli Silva, Levent Tunçel |
Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 29(4), pp. 2650-2676, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Aditya Bhaskara, Samira Daruki, Suresh Venkatasubramanian |
Sublinear Algorithms for MAXCUT and Correlation Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.06992, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
26 | Lior Gishboliner, Michael Krivelevich, Gal Kronenberg |
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 52(4), pp. 545-559, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Aditya Bhaskara, Samira Daruki, Suresh Venkatasubramanian |
Sublinear Algorithms for MAXCUT and Correlation Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pp. 16:1-16:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-076-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Song Mei, Theodor Misiakiewicz, Andrea Montanari, Roberto Imbuzeiro Oliveira |
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017, pp. 1476-1515, 2017, PMLR. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
26 | Sostenes L. Lins, Diogo B. Henriques |
An O(|E|)-linear Model for the MaxCut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.02325, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
26 | Lior Gishboliner, Michael Krivelevich, Gal Kronenberg |
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1603.04044, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
26 | Yatao Bian, Alexey Gronskiy, Joachim M. Buhmann |
Greedy MAXCUT Algorithms and their Information Content. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1609.00810, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
26 | Yatao Bian, Alexey Gronskiy, Joachim M. Buhmann |
Information-theoretic analysis of MaxCut algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITA ![In: 2016 Information Theory and Applications Workshop, ITA 2016, La Jolla, CA, USA, January 31 - February 5, 2016, pp. 1-5, 2016, IEEE, 978-1-5090-2529-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Irène Waldspurger, Alexandre d'Aspremont, Stéphane Mallat |
Phase recovery, MaxCut and complex semidefinite programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 149(1-2), pp. 47-81, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Yatao Bian, Alexey Gronskiy, Joachim M. Buhmann |
Greedy MaxCut algorithms and their information content. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: 2015 IEEE Information Theory Workshop, ITW 2015, Jerusalem, Israel, April 26 - May 1, 2015, pp. 1-5, 2015, IEEE, 978-1-4799-5524-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Yonatan Bilu, Amit Daniely, Nati Linial, Michael E. Saks |
On the practically interesting instances of MAXCUT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 526-537, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Yonatan Bilu, Amit Daniely, Nati Linial, Michael E. Saks |
On the practically interesting instances of MAXCUT ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1205.4893, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
26 | Xiaojun Zhou |
Improved Canonical Dual Algorithms for the Maxcut Problem ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1210.3962, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
26 | M. Shel Swenson, Rahul Suri, C. Randal Linder, Tandy J. Warnow |
An experimental study of Quartets MaxCut and other supertree methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 6, pp. 7, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Luigi Grippo, Laura Palagi, Veronica Piccialli |
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 126(1), pp. 119-146, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Satyen Kale, C. Seshadhri 0001 |
Combinatorial Approximation Algorithms for MaxCut using Random Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings, pp. 367-388, 2011, Tsinghua University Press, 978-7-302-24517-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
26 | Sagi Snir, Satish Rao |
Quartets MaxCut: A Divide and Conquer Quartets Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 7(4), pp. 704-718, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Satyen Kale, C. Seshadhri 0001 |
Combinatorial Approximation Algorithms for MaxCut using Random Walks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1008.3938, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
26 | M. Shel Swenson, Rahul Suri, C. Randal Linder, Tandy J. Warnow |
An Experimental Study of Quartets MaxCut and Other Supertree Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010. Proceedings, pp. 288-299, 2010, Springer, 978-3-642-15293-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 104(2), pp. 65-72, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Artur Czumaj, Gereon Frahling, Christian Sohler |
Efficient Kinetic Data Structures for MaxCut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pp. 157-160, 2007, Carleton University, Ottawa, Canada, 978-0-7709-0520-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
26 | Kartik Krishnan, John E. Mitchell 0001 |
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 33(1), pp. 51-71, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Enrique Mérida Casermeiro, Domingo López-Rodríguez, Juan Miguel Ortiz-de-Lazcano-Lobato |
Enhanced maxcut clustering with multivalued neural networks and functional annealing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESANN ![In: 14th European Symposium on Artificial Neural Networks, ESANN 2006, Bruges, Belgium, April 26-28, 2006, Proceedings, pp. 25-30, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
26 | Meena Mahajan, Venkatesh Raman 0001 |
Parameterizing above Guaranteed Values: MaxSat and MaxCut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 31(2), pp. 335-354, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Jun Dong Cho, Salil Raje, Majid Sarrafzadeh |
Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering vor VLSI Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 47(11), pp. 1253-1266, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Steven Homer, Marcus Peinado |
Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 46(1), pp. 48-61, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Meena Mahajan, Venkatesh Raman 0001 |
Parametrizing Above Guaranteed Values: MaxSat and MaxCut ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR97, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
26 | Thomas Hofmeister, Hanno Lefmann |
A combinatorial design approach to MAXCUT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 9(1-2), pp. 163-175, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
18 | Joel A. Tropp |
Column subset selection, matrix factorization, and eigenvalue optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 978-986, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Claire Mathieu, Warren Schudy |
Yet another algorithm for dense max cut: go greedy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 176-182, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff 0001 |
Drawing (Complete) Binary Tanglegrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 324-335, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Prasad Raghavendra |
Optimal algorithms and inapproximability results for every CSP? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 245-254, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dictatorship tests, rounding schemes, semidefinite programming, constraint satisfaction problem, unique games conjecture |
18 | Michael Krüger, Harald Hempel |
Approximating Alternative Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 204-214, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro |
Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 109(2-3), pp. 211-237, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C22, 90C25, 90C51, 65K10 |
18 | Christian Borgs, Jennifer T. Chayes, László Lovász 0001, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi |
Graph limits and parameter testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 261-270, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
convergence of graphs, distance of graphs, graph limit, property testing, graph homomorphism |
18 | Michael Langberg, Yuval Rabani, Chaitanya Swamy |
Approximation Algorithms for Graph Homomorphism Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 176-187, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Enrique Mérida Casermeiro, Domingo López-Rodríguez |
Graph Partitioning via Recurrent Multivalued Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWANN ![In: Computational Intelligence and Bioinspired Systems, 8th International Work-Conference on Artificial Neural Networks, IWANN 2005, Vilanova i la Geltrú, Barcelona, Spain, June 8-10, 2005, Proceedings, pp. 1149-1156, 2005, Springer, 3-540-26208-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Moses Charikar, Anthony Wirth |
Maximizing Quadratic Programs: Extending Grothendieck's Inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 54-60, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 146-154, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Philipp Woelfel |
A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 23-32, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Stefan A. Blum |
From a CORBA-Based Software Framework to a Component-Based System Architecture for Controlling a Mobile Robot. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICVS ![In: Computer Vision Systems, Third International Conference, ICVS 2003, Graz, Austria, April 1-3, 2003, Proceedings, pp. 333-344, 2003, Springer, 3-540-00921-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Martin Skutella |
Convex quadratic and semidefinite programming relaxations in scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(2), pp. 206-242, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
unrelated machines, approximation algorithms, randomized algorithms, convex optimization, performance guarantee, scheduling theory, worst-case ratio |
18 | Garud Iyengar, Mehmet Tolga Çezik |
Cutting Planes for Mixed 0-1 Semidefinite Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 251-263, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Martin Skutella |
Semidefinite Relaxations for Parallel Machine Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 472-481, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, randomized algorithms, semidefinite programming, convex programming |
18 | Katja Wolf |
Dense Instances of Hard Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 299-312, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Hofmeister, Martin Hühne |
Semidefinite Programming and Its Applications to Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 263-298, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Yoji Kajitani, Jun Dong Cho, Majid Sarrafzadeh |
New Approximation Results on Graph Matching and related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 343-358, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Hans L. Bodlaender, Klaus Jansen |
On the Complexity of the Maximum Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 769-780, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Jun Dong Cho, Majid Sarrafzadeh, Mysore Sriram, Sung-Mo Kang |
High-Performance MCM Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Des. Test Comput. ![In: IEEE Des. Test Comput. 10(4), pp. 27-37, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|