"Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Approximation Algorithms	Vijay V. Vazirani	2003	Springer Berlin Heidelberg
Approximation Theory and Algorithms for Data Analysis	Armin Iske	1st ed. 2018	Springer International Publishing
Approximation algorithms for NP-hard problems /	Hochbaum, Dorit S.	[1997], ©1997.	PWS Pub. Co.,
Approximation Algorithms and Semidefinite Programming	Bernd Gärtner; Jiri Matousek	2012	Springer Berlin Heidelberg
Randomized Algorithms: Approximation, Generation, and Counting	Russ Bubley	2001	Springer London
Design and Analysis of Approximation Algorithms	Ding-Zhu Du; Ker-I Ko; Xiaodong Hu	2012	Springer New York
Handbook of Approximation Algorithms and Metaheuristics	Teofilo F. Gonzalez	2007	Chapman & Hall/CRC
Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications	Zhening Li; Simai He; Shuzhong Zhang	2012	Springer New York
The Design of Approximation Algorithms	David P. Williamson; David B. Shmoys	2011-04	Cambridge University Press
Stochastic Approximation and Recursive Algorithms and Applications	Harold Kushner; G. George Yin	1997	Springer New York
Stochastic Approximation and Recursive Algorithms and Applications	Harold Kushner; G. George Yin	2nd ed. 2003	Springer New York
Approximation and Optimization: Algorithms, Complexity and Applications	Ioannis C. Demetriou; Panos M. Pardalos	1st ed. 2019	Springer International Publishing
Sequencing,Rounding,and Estimation (Lifepac Math Grade 4)	Carol Bauler	March 2001	Alpha Omega Publications (AZ)
Lectures on Proof Verification and Approximation Algorithms	Ernst W. Mayr; Hans Jürgen Prömel; Angelika Steger	1998	Springer Berlin Heidelberg
3ds Max 4 for Windows	Michele Matossian	2001	Peachpit Press
Approximation by Max-Product Type Operators	Barnabás Bede; Lucian Coroianu; Sorin G. Gal	1st ed. 2016	Springer International Publishing
Max-linear Systems: Theory and Algorithms	Peter Butkovič	2010	Springer London
Approximation Procedures in Nonlinear Oscillation Theory	Nikolai A. Bobylev; Yurii M. Burman; Sergey K. Korovin	1994	De Gruyter
Low Rank Approximation: Algorithms, Implementation, Applications	Ivan Markovsky	2012	Springer London
Low-Rank Approximation: Algorithms, Implementation, Applications	Ivan Markovsky	2nd ed. 2019	Springer International Publishing
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 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
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT	Adi Avidor; Ido Berkovitch; Uri Zwick	Approximation and Online Algorithms: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers	Thomas Erlebach; Giuseppe Persiano	2006	Springer Berlin Heidelberg
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
On Some Recent Approximation Algorithms for MAX SAT	Matthias Poloczek; David P. Williamson; Anke van Zuylen	LATIN 2014: Theoretical Informatics: 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings	Alberto Pardo; Alfredo Viola	2014	Springer Berlin Heidelberg
Sublinear-Space Approximation Algorithms for Max r-SAT	Arindam Biswas; Venkatesh Raman	Computing and Combinatorics: 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings	Chi-Yeh Chen; Wing-Kai Hon; Ling-Ju Hung; Chia-Wei Lee	1st ed. 2021	Springer International Publishing
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs	Philip N. Klein; Hsueh-I Lu	Algorithms and Computation: 9th International Symposium, ISAAC' 98, Taejon, Korea, December 14-16, 1998, Proceedings	Kyung-Yong Chwa; Oscar H. Ibarra	1998	Springer Berlin Heidelberg
Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example	Uriel Feige	Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques: Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX' 99, Berkeley, CA, USA, August 8-11, 1999 Pro	Dorit Hochbaum; Klaus Jansen; Jose D.P. Rolim; Alistair Sinclair	1999	Springer Berlin Heidelberg
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson	T. Asano	Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems: June 17-19, 1997, Ramat-Gan, Israel /	Israel Symposium on the Theory of Computing and Systems (5th 1997 Ramat-Gan, Israel)	[1997], ©1997.	IEEE Computer Society Press,
Semidefinite Programming Approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives		Combinatorial and Global Optimization	R.E. Burkard, Panos M. Pardalos, Athanasios Migdalas, Rainer E. Burkard	2002	World Scientific Pub Co (
6 - Randomized Rounding of Semidefinite Programs		The Design of Approximation Algorithms	David P. Williamson; David B. Shmoys	2011-04	Cambridge University Press
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
The RPR 2 Rounding Technique for Semidefinite Programs	Uriel Feige; Michael Langberg	Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings	Fernando Orejas; Paul G. Spirakis; Jan van Leeuwen	2001	Springer Berlin Heidelberg
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
Improved Exact Algorithms for Max-Sat	Jianer Chen; Iyad A. Kanj	LATIN 2002: Theoretical Informatics: 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings	Sergio Rajsbaum	2002	Springer Berlin Heidelberg
Approximate Algorithms and Heuristics for MAX-SAT	Roberto Battiti; Marco Protasi	Handbook of Combinatorial Optimization	Ding-Zhu Du; Panos M. Pardalos	1998	Springer US
Feasible and Accurate Algorithms for Covering Semidefinite Programs	Garud Iyengar; David J. Phillips; Cliff Stein	Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings	Haim Kaplan	2010	Springer Berlin Heidelberg
An approximation algorithm for MAX 3-SAT	Takao Ono; Tomio Hirata; Takao Asano	Algorithms and Computations: 6th International Symposium, ISAAC ' 95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.	John Staples; Peter Eades; Naoki Katoh; Alistair Moffat	1995	Springer Berlin Heidelberg
The Power of Semidefinite Programming Relaxations for MAX-SAT	Carla P. Gomes; Willem-Jan van Hoeve; Lucian Leahu	Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings	J. Christopher Beck; Barbara Smith	2006	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
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs" - similar Books and Chapters