"Approximation Algorithms for Minimizing Average Distorti"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Simplicial Algorithms for Minimizing Polyhedral Functions	M. R. Osborne	February 15, 2001	Cambridge University Press
Approximation Algorithms	Vijay V. Vazirani	2003	Springer Berlin Heidelberg
Approximation algorithms for NP-hard problems /	Hochbaum, Dorit S.	[1997], ©1997.	PWS Pub. Co.,
Approximation Theory and Algorithms for Data Analysis	Armin Iske	1st ed. 2018	Springer International Publishing
Quadratic algorithms for minimizing joins in restricted relational expressions	Yehoshua Sagiv	1979	Dept. of Computer Science, University of Illinois at Urbana-Champaign
Approximation Algorithms and Semidefinite Programming	Bernd Gärtner; Jiri Matousek	2012	Springer Berlin Heidelberg
The Design of Approximation Algorithms	David P. Williamson; David B. Shmoys	2011-04	Cambridge University Press
Average analysis of simple path algorithms	Yehoshua Perl	1977	Dept. of Computer Science, University of Illinois at Urbana-Champaign
Low Rank Approximation: Algorithms, Implementation, Applications	Ivan Markovsky	2012	Springer London
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
Low-Rank Approximation: Algorithms, Implementation, Applications	Ivan Markovsky	2nd ed. 2019	Springer International Publishing
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
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
Average Case Analysis of Algorithms on Sequences	Wojciech Szpankowski	2001	John Wiley & Sons
Stochastic Approximation and Recursive Algorithms and Applications	Harold Kushner; G. George Yin	1997	Springer New York
Lectures on Proof Verification and Approximation Algorithms	Ernst W. Mayr; Hans Jürgen Prömel; Angelika Steger	1998	Springer Berlin Heidelberg
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
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 Minimizing Average Distorti		STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings	Claire Kenyon (auth.), Volker Diekert, Michel Habib (eds.)	2004	Springer-Verlag Berlin Heidelberg
Approximation Algorithms for Minimizing Average Distortion	Kedar Dhamdhere; Anupam Gupta; R. Ravi	STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings	Volker Diekert; Michel Habib	2004	Springer Berlin Heidelberg
Distorti		Introduction to Sound: Acoustics for the Hearing and Speech Sciences	Charles E. Speaks Ph.D. (auth.)	1992	Springer US
Better Algorithms for Minimizing Average Flow-Time on Related Machines	Naveen Garg; Amit Kumar	Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I	Michele Bugliesi; Bart Preneel; Vladimiro Sassone; Ingo Wegener	2006	Springer Berlin Heidelberg
Approximation Algorithms for Minimizing Empirical Error by Axis-Parallel Hyperplanes	Tapio Elomaa; Jussi Kujala; Juho Rousu	Machine Learning: ECML 2005: 16th European Conference on Machine Learning, Porto, Portugal, October 3-7, 2005, Proceedings	João Gama; Rui Camacho; Pavel Brazdil; Alípio Jorge; Luís Torgo	2005	Springer Berlin Heidelberg
Approximation Algorithms for TSP		Optimization Theory	Hubertus Th. Jongen; Klaus Meer; Eberhard Triesch	2004	Springer US
Approximation algorithms for clustering	Pratyay Kuila; Prasanta K. Jana	Clustering and Routing Algorithms for Wireless Sensor Networks: Energy Efficient Approaches	Pratyay Kuila; Prasanta K. Jana	2017	Routledge
Minimizing Average Flow-Time	Naveen Garg	Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday	Susanne Albers; Helmut Alt; Stefan Näher	2009	Springer Berlin Heidelberg
Approximation Algorithms	Czesław Smutnicki	Operations Research Proceedings 1996: Selected Papers of the Symposium on Operations Research (SOR 96), Braunschweig, September 3 - 6, 1996	Uwe Zimmermann; Ulrich Derigs; Wolfgang A. Gaul; Rolf H. Möhring; Karl-Peter Schuster	1997	Springer Berlin Heidelberg
Approximation Algorithms	Juraj Hromkovič	Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics	Juraj Hromkovič	2001	Springer Berlin Heidelberg
Approximation Algorithms	Adam Kasperski	Discrete Optimization with Interval Data: Minmax Regret and Fuzzy Approach	Adam Kasperski	2008	Springer Berlin Heidelberg
Approximation Algorithms	Bernhard Korte; Jens Vygen	Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	2000	Springer Berlin Heidelberg
Approximation Algorithms		Bioinformatics: Problem Solving Paradigms	Volker Sperschneider	2008	Springer Berlin Heidelberg
Approximation Algorithms	Bernhard Korte; Jens Vygen	Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	5th ed. 2012	Springer Berlin Heidelberg
Approximation Algorithms	Juraj Hromkovič	Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics	Juraj Hromkovič	2nd ed. 2004	Springer Berlin Heidelberg
Approximation Algorithms	Daniele Micciancio; Shafi Goldwasser	Complexity of Lattice Problems: A Cryptographic Perspective	Daniele Micciancio; Shafi Goldwasser	2002	Springer US
Approximation Algorithms	Sachi Nandan Mohanty; Pabitra Kumar Tripathy; Suneeta Satpathy	The Art of Algorithm Design	Sachi Nandan Mohanty; Pabitra Kumar Tripathy; Suneeta Satpathy	2021	Routledge
Approximation Algorithms		Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	3rd ed. 2006	Springer Berlin Heidelberg
Approximation Algorithms	Hans Jürgen Prömel; Angelika Steger	The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity	Hans Jürgen Prömel; Angelika Steger	2002	Vieweg+Teubner Verlag
Approximation Algorithms		Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	4th ed. 2008	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Approximation Algorithms for Minimizing Average Distorti" - similar Books and Chapters