"Efficient Primal-Dual Graph Algorithms for MapReduce"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms	Jiming Peng; Cornelis Roos; Tamás Terlaky	2003	Princeton University Press
Graph Algorithms	Shimon Even; Guy Even	2011-09	Cambridge University Press
Efficient graph representations /	Spinrad, Jeremy P.	[2003], ©2003.	American Mathematical Society,
Efficient algorithms for cyclic scheduling.	Franco Gasperoni	1991	Courant Institute of Mathematical Sciences, New York University
Distributed Graph Algorithms for Computer Networks	K. Erciyes	2013	Springer London
Algorithms illuminated. Part 2. Graph algorithms	Roughgarden T	2018	Soundlikeyourself
Area-efficient and volume-efficient algorithms for loading cargo	Ernest Larry DeSha	1970	Naval Postgraduate School
Efficient Predictive Algorithms for Image Compression	Luís Filipe Rosário Lucas; Eduardo Antônio Barros da Silva; Sérgio Manuel Maciel de Faria; Nuno Miguel Morais Rodrigues; Carla Liberal Pagliari	1st ed. 2017	Springer International Publishing
Efficient Algorithms for Listing Combinatorial Structures	Leslie Ann Goldberg	1993-04	Cambridge University Press
Designing efficient algorithms for parallel computers	Michael J. Quinn	1987	McGraw-Hill
Efficient Algorithms for Listing Combinatorial Structures.	Leslie Ann Goldberg	2009	Cambridge University Press
Fast parallel algorithms for graph matching problems	Marek Karpiński	1998	Clarendon Press
Algorithms in C, Part 5: Graph Algorithms	Sedgewick, Robert	2001;2002	Addison-Wesley Professional
Algorithms in C++ Part 5: Graph Algorithms	Sedgewick, Robert; Wyk, Christopher J. van	2001	Addison-Wesley Professional
Algorithms in C, Part 5: Graph Algorithms	Sedgewick, Robert	2002	Addison-Wesley
Efficient algorithms for grouping component-processor families	K. Ravi Kumar	1984	College of Commerce and Business Administration, University of Illinois at Urbana-Champaign
Remarks on efficient numerical algorithms for ultracomputers	Charles S. Peskin	1981	Courant Institute of Mathematical Sciences, New York University
Polynomial dual network simplex algorithms	James B. Orlin	1991	Alfred P. Sloan School of Management, Massachusetts Institute of Technology
A Guide to Graph Algorithms	Ton Kloks; Mingyu Xiao	1st ed. 2022	Springer Nature Singapore
Efficient Graph Rewriting and Its Implementation	Heiko Dörr	1995	Springer Berlin Heidelberg
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
Efficient Primal-Dual Graph Algorithms for MapReduce	Bahman Bahmani; Ashish Goel; Kamesh Munagala	Algorithms and Models for the Web Graph: 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings	Anthony Bonato; Fan Chung Graham; Paweł Prałat	2014	Springer International Publishing
Two efficient primal-dual algorithms for MRI Rician denoising	A. Martin, J.F. Garamendi &a; E. Schiavi	Computational Modelling of Objects Represented in Images III: Fundamentals, Methods and Applications	Paolo Di Giamberardino; Daniela Iacoviello; João Manuel R.S. Tavares; R.M. Natal Jorge	2012	Routledge
Primal-dual algorithms for data depth	David Bremner, Komei Fukuda and Vera Rosta	Data depth: robust multivariate analysis, computational geometry, and applications /	Liu, Regina Y.; Serfling, Robert J.; Souvaine, Diane L.	c2006.	American Mathematical Society,
The Primal-Dual Approach for Online Algorithms	Nikhil Bansal	Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers	Thomas Erlebach; Giuseppe Persiano	2013	Springer Berlin Heidelberg
Deriving Efficient Graph Algorithms	John H. Reif; William L. Scherlis	Verification: Theory and Practice: Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday	Nachum Dershowitz	2003	Springer Berlin Heidelberg
Efficient parallel graph algorithms	Vijaya Ramachandran	Lectures on parallel computation /	Gibbons, Alan; Spirakis, P. G.	2005, ©1993.	Cambridge University Press,
Randomization for Efficient Dynamic Graph Algorithms	Surender Baswana	Algorithms and Discrete Applied Mathematics: Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings	Sathish Govindarajan; Anil Maheshwari	1st ed. 2016	Springer International Publishing
Primal-dual schema based approximation algorithms	Vijay V. Vazirani	Computing and Combinatorics: First Annual International Conference, COCOON ' 95, Xi' an, China, August 24-26, 1995. Proceedings	Ding-Zhu Du; Ming Li	1995	Springer Berlin Heidelberg
Primal-Dual Schema Based Approximation Algorithms	Vijay V. Vazirani	Theoretical Aspects of Computer Science: Advanced Lectures	Gholamreza B. Khosrovshahi; Ali Shokoufandeh; Amin Shokrollahi	2002	Springer Berlin Heidelberg
Primal-Dual Algorithms for Connected Facility Location Problems	Chaitanya Swamy; Amit Kumar	Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings	Klaus Jansen; Stefano Leonardi; Vijay Vazirani	2002	Springer Berlin Heidelberg
Primal-Dual Algorithms for Connected Facility Location Proble		Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002 Rome, Italy, September 17–21, 2002 Proceedings	Yuval Rabani (auth.), Klaus Jansen, Stefano Leonardi, Vijay Vazirani (eds.)	2002	Springer-Verlag Berlin Heidelberg
Primal-Dual Algorithms for Precedence Constrained Covering Problems	Andreas Wierz; Britta Peis; S. Thomas McCormick	Approximation and Online Algorithms: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers	Evripidis Bampis; Ola Svensson	2015	Springer International Publishing
Efficient primal algorithms for strictly convex quadratic programs	Donald Goldfarb	Numerical Analysis: Proceedings of the Fourth IIMAS Workshop held at Guanajuato, Mexico, July 1984	Jean-Pierre Hennart	1986	Springer Berlin Heidelberg
Efficient primal algorithms for strictly convex quadratic progra		Numerical Analysis: Proceedings of the Fourth IIMAS Workshop held at Guanajuato, Mexico, July 23–27, 1984	S. Gomez, A. V. Levy, A. Calderon (auth.), Jean-Pierre Hennart (eds.)	1986	Springer-Verlag Berlin Heidelberg
Deriving efficient graph algorithms (summary)	John H. Reif; William L. Scherlis	Logics of Programs: Workshop Carnegie Mellon University Pittsburgh, PA, June 6-8, 1983	E. Clarke; D. Kozen	1984	Springer Berlin Heidelberg
Efficient Algorithms for a Graph Partitioning Problem	S. Vaishali; M. S. Atulya; Nidhi Purohit	Frontiers in Algorithmics: 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings	Jianer Chen; Pinyan Lu	1st ed. 2018	Springer International Publishing
Online Primal-Dual Algorithms for Covering and Packing Problems	Niv Buchbinder; Joseph Naor	Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings	Gerth S. Brodal; Stefano Leonardi	2005	Springer Berlin Heidelberg
On Primal—Dual Path—Following Algorithms for Semidefinite Programming	E. de Klerk; C. Roos; T. Terlaky	New Trends in Mathematical Programming: Homage to Steven Vajda	F. Giannessi; Sándor Komlósi; Tamás Rapcsák	1998	Springer US
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue	Niv Buchbinder; Kamal Jain; Joseph (Seffi) Naor	Algorithms - ESA 2007: 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings	Lars Arge; Michael Hoffmann; Emo Welzl	2007	Springer Berlin Heidelberg
Primal-Dual Pairs	Manfred Padberg	Linear Optimization and Extensions	Manfred Padberg	2nd ed. 1999	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Efficient Primal-Dual Graph Algorithms for MapReduce" - similar Books and Chapters