NDLI: Approximate max flow on small depth networks

Content Provider	IEEE Xplore Digital Library
Author	Cohen, E.
Copyright Year	1992
Description	Author affiliation: AT&T Bell Labs., Murray Hill, NJ, USA (Cohen, E.)
Abstract	The author considers the maximum flow problem on directed acyclic networks with m edges and depth r (length of the longest s-t path). The main result is a new deterministic algorithm for solving the relaxed problem of computing an s-t flow of value at least (1- epsilon ) of the maximum flow. For instances where r and epsilon /sup -1/ are small (i.e., O(polylog(m))), this algorithm is in NC and uses only O(m) processors, which is a significant improvement over existing parallel algorithms. As one consequence, he obtains an NC O(m) processor algorithm to find a bipartite matching of cardinality (1- epsilon ) of the maximum (for epsilon /sup -1/ = O(polylog(m))). The parallel bounds are based on a novel approach to the blocking flow problem that produces fractional valued flow augmentations even when capacities are integral. She shows that a fractional flow on any network with integral capacities can be rounded in polylogarithmic time to an integral flow of no smaller value using O(m) processors. Hence, within the same resource bounds, an integral flow can be obtained when desired.<>
Starting Page	648
Ending Page	658
File Size	784254
Page Count	11
File Format	PDF
ISBN	0818629002
DOI	10.1109/SFCS.1992.267786
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1992-10-24
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parallel algorithms Polynomials Integral equations Phase change random access memory
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An efficient parallel algorithm for min-cost flow on directed series-parallel networks

Parallel algorithms for vehicle routing problems

Fast and scalable parallel algorithms for matrix chain product and matrix powers on distributed memory systems

Approximate parallel prefix computation and its applications

Towards optimal parallel radix sorting

Constructing the spanners of graphs in parallel

On a fast deterministic parallel approximate matching algorithm

Approximate Max-Flow on Small Depth Networks

Fast parallel matrix and GCD computations

Approximate max flow on small depth networks

Similar Documents

An efficient parallel algorithm for min-cost flow on directed series-parallel networks

Parallel algorithms for vehicle routing problems

Fast and scalable parallel algorithms for matrix chain product and matrix powers on distributed memory systems

Approximate parallel prefix computation and its applications

Towards optimal parallel radix sorting

Constructing the spanners of graphs in parallel

On a fast deterministic parallel approximate matching algorithm

Approximate Max-Flow on Small Depth Networks

Fast parallel matrix and GCD computations

Approximate max flow on small depth networks