"Approximation Algorithms for Partial Covering Problems"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Approximation algorithms for NP-hard problems /	Hochbaum, Dorit S.	[1997], ©1997.	PWS Pub. Co.,
Approximation Algorithms	Vijay V. Vazirani	2003	Springer Berlin Heidelberg
Approximation Theory and Algorithms for Data Analysis	Armin Iske	1st ed. 2018	Springer International Publishing
Optimal Control Problems for Partial Differential Equations on Reticulated Domains: Approximation and Asymptotic Analysis	Peter I. Kogut; Günter R. Leugering	2011	Birkhäuser Boston
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
Numerical Approximation of Partial Differential Equations	Sören Bartels	1st ed. 2016	Springer International Publishing
Numerical approximation of partial differential equations	Alfio Quarteroni, Alberto Valli (auth.)	1994	Springer-Verlag Berlin Heidelberg
Numerical Approximation of Partial Differential Equations	Alfio Quarteroni; Alberto Valli	1994	Springer Berlin Heidelberg
Scalable Algorithms for Contact Problems	Zdeněk Dostál; Tomáš Kozubek; Marie Sadowská; Vít Vondrák	1st ed. 2016	Springer New York
Constructive Approximation: Advanced Problems	George G. Lorentz, Manfred v. Golitschek, Yuly Makovoz	2011	Springer
Constructive approximation: advanced problems /	Lorentz, G. G.; Golitschek, Manfred von,; Makovoz, Yuly,	[1996], ©1996.	Springer,
Inverse Problems for Partial Differential Equations	Victor Isakov	2nd ed. 2006	Springer New York
Inverse Problems for Partial Differential Equations	Yurii Ya. Belov	2002	De Gruyter
Inverse Problems for Partial Differential Equations	Victor Isakov	3rd ed. 2017	Springer International Publishing
Inverse Problems for Partial Differential Equations	Victor Isakov	1998	Springer New York
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
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 Partial Covering Problems	Rajiv Gandhi; Samir Khuller; Aravind Srinivasan	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
Improved Approximation Algorithms for Minimum Power Covering Problems	Gruia Calinescu; Guy Kortsarz; Zeev Nutov	Approximation and Online Algorithms: 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers	Leah Epstein; Thomas Erlebach	1st ed. 2018	Springer International Publishing
Approximation Algorithms for Mixed Fractional Packing and Covering Problems	Klaus Jansen	Exploring New Frontiers of Theoretical Informatics: IFIP 18th World Computer Congress TC1 3rd International Conference on Theoretical Computer Science (TCS2004) 22–27 August 2004 Toulouse, France	Jean-Jacques Lévy; Ernst W. Mayr; John C. Mitchell	2004	Springer US
Approximation Algorithms for Mixed Fractional Packing and Covering Problems	Klaus Jansen	Approximation and Online Algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers	Giuseppe Persiano; Roberto Solis-Oba	2005	Springer Berlin Heidelberg
Approximation Algorithms for Edge-Covering Problem	Mohammad Hosseinzadeh Moghaddam; Alireza Bagheri	Advances in Computer Science and Engineering: 13th International CSI Computer Conference, CSICC 2008 Kish Island, Iran, March 9-11, 2008 Revised Selected Papers	Hamid Sarbazi-Azad; Behrooz Parhami; Seyed-Ghasem Miremadi; Shaahin Hessabi	2009	Springer Berlin Heidelberg
Algorithms for polytope covering and approximation	Kenneth L. Clarkson	Algorithms and Data Structures: Third Workshop, WADS ' 93, Montreal, Canada, August 11-13, 1993. Proceedings	Frank Dehne; Jörg-Rüdiger Sack; Nicola Santoro; Sue Whitesides	1993	Springer Berlin Heidelberg
Better Approximation Algorithms for Bin Covering		Proc. 12th annual ACM-SIAM symposium on discrete algorithms (SIAM 2001)	SIAM	2001	Society for Industrial Mathematics
Algorithms for Rectangular Covering Problems	Stefan Porschen	Computational Science and Its Applications - ICCSA 2006: International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I	Osvaldo Gervasi; Vipin Kumar; C.J. Kenneth Tan; David Taniar; Antonio Laganà; Youngsong Mun; Hyunseung Choo	2006	Springer Berlin Heidelberg
Approximation algorithms for covering polygons with squares and similar problems	Christos Levcopoulos; Joachim Gudmundsson	Randomization and Approximation Techniques in Computer Science: International Workshop RANDOM' 97, Bologna, Italy, July 11-12, 1997 Proceedings	Jose Rolim	1997	Springer Berlin Heidelberg
Approximation Algorithms for Fractional Covering and Packing Problems, and Applications	Klaus Jansen	Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings	Rusins Freivalds	2001	Springer Berlin Heidelberg
Approximation Algorithms for Scheduling Problems	Jean-Claude Ko¨nig and Rodolphe Giroudeau	Introduction to Scheduling	Yves Robert; Frederic Vivien	2009	Routledge
- Approximation Algorithms for Connectivity Problems	Krishnaiyan "KT" Thulasiraman; Subramanian Arumugam; Andreas Brandstädt; Takao Nishizeki	Handbook of Graph Theory, Combinatorial Optimization, and Algorithms	Krishnaiyan "KT" Thulasiraman; Subramanian Arumugam; Andreas Brandstädt; Takao Nishizeki	2015	Routledge
On-line and off-line approximation algorithms for vector covering problems	Noga Alon; János Csirik; Sergey V. Sevastianov; Arjen P. A. Vestjens; Gerhard J. Woeginger	Algorithms - ESA ' 96: Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996. Proceedings	Joseph Diaz; Maria Serna	1996	Springer Berlin Heidelberg
Partial Covering Arrays: Algorithms and Asymptotics	Kaushik Sarkar; Charles J. Colbourn; Annalisa de Bonis; Ugo Vaccaro	Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings	Veli Mäkinen; Simon J. Puglisi; Leena Salmela	1st ed. 2016	Springer International Publishing
Approximation Algorithms for String Folding Problems	Giancarlo Mauri; Giulio Pavesi	Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics: International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings	Jan Leeuwen; Osamu Watanabe; Masami Hagiya; Peter D. Mosses; Takayasu Ito	2000	Springer Berlin Heidelberg
Better Approximation Algorithms for Scaffolding Problems	Zhi-Zhong Chen; Youta Harada; Eita Machida; Fei Guo; Lusheng Wang	Frontiers in Algorithmics: 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings	Daming Zhu; Sergey Bereg	1st ed. 2016	Springer International Publishing
Approximation Algorithms for Graph Homomorphism Problems	Michael Langberg; Yuval Rabani; Chaitanya Swamy	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	Josep Diaz; Klaus Jansen; José D.P. Rolim; Uri Zwick	2006	Springer Berlin Heidelberg
Approximation Algorithms for k-Hurdle Problems	Brian C. Dean; Adam Griffis; Adam Whitley	LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings	Eduardo Sany Laber; Claudson Bornstein; Loana Tito Nogueira; Luerbio Faria	2008	Springer Berlin Heidelberg
Approximation Algorithms for Facility Location Problems	David B. Shmoys	Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings	Klaus Jansen; Samir Khuller	2000	Springer Berlin Heidelberg
Approximation Algorithms for Hamming Clustering Problems	Leszek Gąasieniec; Jesper Jansson; Andrzej Lingas	Combinatorial Pattern Matching: 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings	Raffaele Giancarlo; David Sankoff	2000	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Approximation Algorithms for Partial Covering Problems" - similar Books and Chapters