"Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Approximation Algorithms and Semidefinite Programming	Bernd Gärtner; Jiri Matousek	2012	Springer Berlin Heidelberg
Approximation Algorithms	Vijay V. Vazirani	2003	Springer Berlin Heidelberg
Machine learning algorithms using Python programming	Gaurav Patil; Gopal Sakarkar; Prateek Dutta	2021	Nova Science Publishers
Approximation Algorithms for Complex Systems: Proceedings of the 6th International Conference on Algorithms for Approximation, Ambleside, UK, 31st August - 4th September 2009	Emmanuil H Georgoulis; Armin Iske; Jeremy Levesley	2011	Springer Berlin Heidelberg
Guide to Programming and Algorithms Using R	Özgür Ergül	2013	Springer London
Algorithms illuminated Part 3 Greedy Algorithms and Dynamic Programming	Tim Roughgarden	2019	Soundlikeyourself
Algorithms Illuminated. Part 3: Greedy Algorithms and Dynamic Programming	Tim Roughgarden	2019	Soundlikeyourself Publishing, LLC
Approximation algorithms for NP-hard problems /	Hochbaum, Dorit S.	[1997], ©1997.	PWS Pub. Co.,
Algorithms for Functional Programming	John David Stone	1st ed. 2018	Springer Berlin Heidelberg
Algorithms for network programming	Jeff L. Kennington	1980	Wiley
Complex Approximation: Proceedings, Quebec, Canada July 3–8, 1978	B. Aupetit	1st ed. 1980	Birkhäuser Boston
Approximation Theory and Algorithms for Data Analysis	Armin Iske	1st ed. 2018	Springer International Publishing
Overconvergence in Complex Approximation	Sorin G. Gal	2013	Springer New York
Lectures on Complex Approximation	GAIER	1987	Birkhäuser Boston
Lectures on complex approximation	Dieter Gaier	1987	Birkhäuser
Topics in complex approximation /	Anastassiou, George A.,
Introduction to assembly language programming using the Max computer	J. M. Harris	1982	Charles Babbage Research Centre
The Design of Approximation Algorithms	David P. Williamson; David B. Shmoys	2011-04	Cambridge University Press
Algorithms,programming,Pascal	Barbara Li Santi	1987	Wadsworth Pub. Co.
Asymptotic Analyses for Complex Evolutionary Systems with Markov and Semi-Markov Switching Using Approximation Schemes	Yaroslav Chabanyuk	2020	John Wiley & Sons
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation	Ai-fan Ling	Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings	Ding-Zhu Du; Xiaodong Hu; Panos M. Pardalos	2009	Springer Berlin Heidelberg
Semidefinite Programming Based Approximation Algorithms	Uri Zwick	FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science: 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings	Ramesh Hariharan; Madhavan Mukund; V. Vinay	2001	Springer Berlin Heidelberg
Using Complex Semidefinite Programming for Approximating MAX E2-LIN3	Michel X. Goemans	Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001	Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luca Trevisan	2001	Springer Berlin Heidelberg
Semidefinite Programming and Approximation Algorithms: A Survey	Sanjeev Arora	Algorithms and Computation: 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings	Takao Asano; Shin-ichi Nakano; Yoshio Okamoto; Osamu Watanabe	2011	Springer Berlin Heidelberg
Semidefinite Programming and Approximation Algorithms: A Survey	Sanjeev Arora	Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings	Haim Kaplan	2010	Springer Berlin Heidelberg
A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem	Chenchen Wu; Dachuan Xu; Donglei Du; Wen-qing Xu	Computing and Combinatorics: 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014, Proceedings	Zhipeng Cai; Alexander Zelikovsky; Anu Bourgeois	2014	Springer International Publishing
Erratum: A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem	Chenchen Wu; Dachuan Xu; Donglei Du; Wen-qing Xu	Computing and Combinatorics: 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014, Proceedings	Zhipeng Cai; Alexander Zelikovsky; Anu Bourgeois	2014	Springer International Publishing
Semidefinite programming and its applications to approximation algorithms	Thomas Hofmeister; Martin Hühne	Lectures on Proof Verification and Approximation Algorithms	Ernst W. Mayr; Hans Jürgen Prömel; Angelika Steger	1998	Springer Berlin Heidelberg
Constructing worst case instances for semidefinite programming based approximation algorithms		Proc. 12th annual ACM-SIAM symposium on discrete algorithms (SIAM 2001)	SIAM	2001	Society for Industrial Mathematics
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs	Eran Halperin; Uri Zwick	Integer Programming and Combinatorial Optimization: 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings	Gérard Cornuéjols; Rainer E. Burkard; Gerhard J. Woeginger	1999	Springer Berlin Heidelberg
Section 3: Quantum Algorithms Using Silq Programming		Quantum Computing with Silq Programming: Get up and running with the new high-level programming language for quantum computing	Srinjoy Ganguly, Thomas Cambier	2021	Packt Publishing
Biconvex Relaxation for Semidefinite Programming in Computer Vision	Sohil Shah; Abhay Kumar Yadav; Carlos D. Castillo; David W. Jacobs; Christoph Studer; Tom Goldstein	Computer Vision – ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part VI	Bastian Leibe; Jiri Matas; Nicu Sebe; Max Welling	1st ed. 2016	Springer International Publishing
Simpler 3/4-Approximation Algorithms for MAX SAT	Anke van Zuylen	Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers	Roberto Solis-Oba; Giuseppe Persiano	2012	Springer Berlin Heidelberg
Parallel Algorithms for Nonlinear Diffusion by Using Relaxation Approximation	Fausto Cavalli; Giovanni Naldi; Matteo Semplice	Numerical Mathematics and Advanced Applications: Proceedings of ENUMATH 2005 the 6th European Conference on Numerical Mathematics and Advanced Applications, Santiago de Compostela, Spain, July 2005	Alfredo Bermúdez de Castro; Dolores Gómez; Peregrina Quintela; Pilar Salgado	2006	Springer Berlin Heidelberg
Lower Bounds for Max-Cut via Semidefinite Programming	Charles Carlson; Alexandra Kolla; Ray Li; Nitya Mani; Benny Sudakov; Luca Trevisan	LATIN 2020: Theoretical Informatics: 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings	Yoshiharu Kohayakawa; Flávio Keidi Miyazawa	1st ed. 2020	Springer International Publishing
Semidefinite Programming	Bernd Gärtner; Jiří Matoušek	Approximation Algorithms and Semidefinite Programming	Bernd Gärtner; Jiri Matousek	2012	Springer Berlin Heidelberg
Semidefinite Programming	Ding-Zhu Du; Ker-I Ko; Xiaodong Hu	Design and Analysis of Approximation Algorithms	Ding-Zhu Du; Ker-I Ko; Xiaodong Hu	2012	Springer New York
Semidefinite Programming		Encyclopedia of Systems Biology	Werner Dubitzky; Olaf Wolkenhauer; Hiroki Yokota; Kwang-Hyun Cho	2013	Springer New York
Semidefinite Programming	Vijay V. Vazirani	Approximation Algorithms	Vijay V. Vazirani	2003	Springer Berlin Heidelberg
Semidefinite Programming	Ding-Zhu Du; Panos M. Pardalos; Weili Wu	Mathematical Theory of Optimization	Ding-Zhu Du; Panos M. Pardalos; Weili Wu	2001	Springer US
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation" - similar Books and Chapters