Goldberg, Andrew V.
Overview
Works:  55 works in 202 publications in 1 language and 1,221 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other 
Classifications:  QA402.5, 519.64 
Publication Timeline
.
Most widely held works by
Andrew V Goldberg
The shortest path problem : ninth DIMACS implementation challenge by DIMACS implementation challenge(
Book
)
3 editions published in 2009 in English and held by 83 WorldCat member libraries worldwide
3 editions published in 2009 in English and held by 83 WorldCat member libraries worldwide
Algorithmic aspects in information and management : 5th international conference, AAIM 2009, San Francisco, CA, USA, June
1517, 2009 : proceedings by
Andrew V Goldberg(
Book
)
17 editions published in 2009 in English and Undetermined and held by 49 WorldCat member libraries worldwide
This book constitutes the proceedings of the 5th International Conference on Algorithmic Aspects in Information Management, AAIM 2009, held in San Francisco, CA, USA, in June 2009. The 25 papers presented together with the abstracts of two invited talks were carefully reviewed and selected for inclusion in this book. While the areas of information management and management science are full of algorithmic challenges, the proliferation of data (Internet, biology, finance etc) has called for the design of efficient and scalable algorithms and data structures for their management and processing. This conference is intended for original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science, broadly construed. The conference aims at bringing together researchers in Computer Science, Operations Research, Economics, Game Theory, and related disciplines
17 editions published in 2009 in English and Undetermined and held by 49 WorldCat member libraries worldwide
This book constitutes the proceedings of the 5th International Conference on Algorithmic Aspects in Information Management, AAIM 2009, held in San Francisco, CA, USA, in June 2009. The 25 papers presented together with the abstracts of two invited talks were carefully reviewed and selected for inclusion in this book. While the areas of information management and management science are full of algorithmic challenges, the proliferation of data (Internet, biology, finance etc) has called for the design of efficient and scalable algorithms and data structures for their management and processing. This conference is intended for original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science, broadly construed. The conference aims at bringing together researchers in Computer Science, Operations Research, Economics, Game Theory, and related disciplines
Experimental Algorithms : 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 58, 2016, Proceedings by SEA(
)
5 editions published in 2016 in English and held by 40 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities
5 editions published in 2016 in English and held by 40 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities
Sublineartime parallel algorithms for matching and related problems by
Andrew V Goldberg(
Book
)
9 editions published in 1988 in English and Undetermined and held by 23 WorldCat member libraries worldwide
This paper presents the first sublineartime deterministic parallel algorithms for bipartite matching and several related problems, including maximal nodedisjoint paths, depthfirst search, and flows in zeroone networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to use maximal matching to extend, in parallel, a current set of nodedisjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. We also show how to apply our techniques to design parallel algorithms for the weighted versions of the above problems. In particular, we present sublineartime deterministic parallel algorithms for dining a minimumweight bipartite matching and for finding a minimumcost flow in a network with zeroone capacities, if the weights are polynomially bounded integers. Keywords: Network flows. (KR)
9 editions published in 1988 in English and Undetermined and held by 23 WorldCat member libraries worldwide
This paper presents the first sublineartime deterministic parallel algorithms for bipartite matching and several related problems, including maximal nodedisjoint paths, depthfirst search, and flows in zeroone networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to use maximal matching to extend, in parallel, a current set of nodedisjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. We also show how to apply our techniques to design parallel algorithms for the weighted versions of the above problems. In particular, we present sublineartime deterministic parallel algorithms for dining a minimumweight bipartite matching and for finding a minimumcost flow in a network with zeroone capacities, if the weights are polynomially bounded integers. Keywords: Network flows. (KR)
Combinatorial algorithms for the generalized circulation problem by
Andrew V Goldberg(
Book
)
8 editions published in 1988 in English and held by 23 WorldCat member libraries worldwide
We consider a generalization of the maximum network flow problem in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e) gamma (e) units arrive at the other end. For instance, nodes of the graph can correspond to different currencies, with the multipliers being the exchange rates. We require conservation of flow at every node except a given source node. The goal is to maximize the amount of flow excess at the source. This problem is a special case of linear programming, and therefore can be solved in polynomial time. In this paper we present the first polynomial time combinatorial optimization algorithms for this problem. The algorithms are simple and intuitive. (KR)
8 editions published in 1988 in English and held by 23 WorldCat member libraries worldwide
We consider a generalization of the maximum network flow problem in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e) gamma (e) units arrive at the other end. For instance, nodes of the graph can correspond to different currencies, with the multipliers being the exchange rates. We require conservation of flow at every node except a given source node. The goal is to maximize the amount of flow excess at the source. This problem is a special case of linear programming, and therefore can be solved in polynomial time. In this paper we present the first polynomial time combinatorial optimization algorithms for this problem. The algorithms are simple and intuitive. (KR)
Efficiency of the network simplex algorithm for the maximum flow problem by
Andrew V Goldberg(
Book
)
8 editions published between 1988 and 1989 in English and held by 21 WorldCat member libraries worldwide
Goldfarb and Hao have proposed a network simplex algorithm that will solve a maximum flow problem on an nvertex, marc network in at most nm pivots and O(n squared m) time. In this paper we describe how to implement their algorithm to run in O(nmlog n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan. This bound is less than a logarithmic factor larger than that of any other known algorithm for the problem. Keywords: Algorithms; Complexity; Data structures; Dynamic trees; Graphs; Linear programming; Maximum flow; Network flow; Network optimization
8 editions published between 1988 and 1989 in English and held by 21 WorldCat member libraries worldwide
Goldfarb and Hao have proposed a network simplex algorithm that will solve a maximum flow problem on an nvertex, marc network in at most nm pivots and O(n squared m) time. In this paper we describe how to implement their algorithm to run in O(nmlog n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan. This bound is less than a logarithmic factor larger than that of any other known algorithm for the problem. Keywords: Algorithms; Complexity; Data structures; Dynamic trees; Graphs; Linear programming; Maximum flow; Network flow; Network optimization
Efficient graph algorithms for sequential and parallel computers by
Andrew V Goldberg(
Book
)
12 editions published in 1987 in English and Undetermined and held by 18 WorldCat member libraries worldwide
This thesis studies graph algorithms, both in sequential and parallel contexts. In the following outline of the thesis, algorithm complexities are stated in terms of the the number of vertices n, the number of edges m, the largest absolute value of capacities U, and the largest absolute value of costs C. Chapter 1 introduces a new approach to the maximum flow problem that leads to better algorithms for the problem. Chapter 2 is devoted to the minimum cost flow problem, which is a generalization of the maximum flow problem. Chapter 3 addresses implementation of parallel algorithms through a casestudy of an implementation of a parallel maximum flow algorithm. Parallel prefix operations play an important role in our implementation. Present experimental results achieved by the implementation are presented. Present Parallel symmetrybreaking techniques are the main topic of Chapter 4. Keywords: network flows; parallel algorithms
12 editions published in 1987 in English and Undetermined and held by 18 WorldCat member libraries worldwide
This thesis studies graph algorithms, both in sequential and parallel contexts. In the following outline of the thesis, algorithm complexities are stated in terms of the the number of vertices n, the number of edges m, the largest absolute value of capacities U, and the largest absolute value of costs C. Chapter 1 introduces a new approach to the maximum flow problem that leads to better algorithms for the problem. Chapter 2 is devoted to the minimum cost flow problem, which is a generalization of the maximum flow problem. Chapter 3 addresses implementation of parallel algorithms through a casestudy of an implementation of a parallel maximum flow algorithm. Parallel prefix operations play an important role in our implementation. Present experimental results achieved by the implementation are presented. Present Parallel symmetrybreaking techniques are the main topic of Chapter 4. Keywords: network flows; parallel algorithms
A parallel algorithm for finding a blocking flow in an acyclic network by
Andrew V Goldberg(
Book
)
8 editions published in 1988 in English and Undetermined and held by 16 WorldCat member libraries worldwide
We propose a simple parallel algorithm for finding a blocking flow in an acyclic network. On an nvertex, marc network, our algorithm runs in 0(n log n) time and 0(nm) space using an mprocessor EREW PRAM. A consequence of our algorithm is an 0(n²(log n)log(n(ʹ))time, 0(nm)space, mprocessor algorithm for the minimumcost circulation problem, on a network with integer arc capacities of magnitude at most C
8 editions published in 1988 in English and Undetermined and held by 16 WorldCat member libraries worldwide
We propose a simple parallel algorithm for finding a blocking flow in an acyclic network. On an nvertex, marc network, our algorithm runs in 0(n log n) time and 0(nm) space using an mprocessor EREW PRAM. A consequence of our algorithm is an 0(n²(log n)log(n(ʹ))time, 0(nm)space, mprocessor algorithm for the minimumcost circulation problem, on a network with integer arc capacities of magnitude at most C
Interiorpoint methods in parallel computation by
Andrew V Goldberg(
Book
)
5 editions published in 1989 in English and held by 15 WorldCat member libraries worldwide
Ln this paper we use interiorpoint methods for linear programing, developed in the context of sequential computation, to obtain a parallel algorithm for the bipartite matching problem. Our algorithm runs in $O[superscript]n$(SQRT m) time. Our results extend to the weighted bipartite matching problem and to the zeroone minimumcost flow problem, yielding $O[superscript]n$((SQRT m) log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interiorpoint methods in the context of parallel algorithm design
5 editions published in 1989 in English and held by 15 WorldCat member libraries worldwide
Ln this paper we use interiorpoint methods for linear programing, developed in the context of sequential computation, to obtain a parallel algorithm for the bipartite matching problem. Our algorithm runs in $O[superscript]n$(SQRT m) time. Our results extend to the weighted bipartite matching problem and to the zeroone minimumcost flow problem, yielding $O[superscript]n$((SQRT m) log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interiorpoint methods in the context of parallel algorithm design
Processorefficient implementation of a maximum flow algorithm by
Andrew V Goldberg(
Book
)
6 editions published between 1989 and 1990 in English and held by 15 WorldCat member libraries worldwide
In this paper we describe two processorefficient implementations of the Maximum Distance Discharge Algorithm for the maximum flow problem. Using p = 0([square root]m) processors, the first implementation runs in 0(n² log (2m/n + p) ([square root] m/p)) time and uses 0(m + n log n) space; the second implementation runs in 0(n² log n ([square root] m/p)) time and uses 0(m + p log n) space. These bounds are within a logarithmic factor of the O(n² [square root]m) time and 0(m + n) space bounds on the sequential Maximum Discharge Algorithm
6 editions published between 1989 and 1990 in English and held by 15 WorldCat member libraries worldwide
In this paper we describe two processorefficient implementations of the Maximum Distance Discharge Algorithm for the maximum flow problem. Using p = 0([square root]m) processors, the first implementation runs in 0(n² log (2m/n + p) ([square root] m/p)) time and uses 0(m + n log n) space; the second implementation runs in 0(n² log n ([square root] m/p)) time and uses 0(m + p log n) space. These bounds are within a logarithmic factor of the O(n² [square root]m) time and 0(m + n) space bounds on the sequential Maximum Discharge Algorithm
A parallel algorithm for reconfiguring a multibutterfly network with faulty switches by
Andrew V Goldberg(
Book
)
5 editions published in 1992 in English and held by 13 WorldCat member libraries worldwide
Abstract: "This paper describes a deterministic algorithm for reconfiguring a multibutterfly network with faulty switches. Unlike previous reconfiguration algorithms, the algorithm is performed entirely by the network, without the aid of any offline computation, even though many of the switches may be faulty. The algorithm reconfigures an Ninput multibutterfly network in O(log N) time. After reconfiguration, the multibutterfly can tolerate f worstcase faults and still route any permutation between some set of N  O(f) inputs and N  O(f) outputs in O(log N) time."
5 editions published in 1992 in English and held by 13 WorldCat member libraries worldwide
Abstract: "This paper describes a deterministic algorithm for reconfiguring a multibutterfly network with faulty switches. Unlike previous reconfiguration algorithms, the algorithm is performed entirely by the network, without the aid of any offline computation, even though many of the switches may be faulty. The algorithm reconfigures an Ninput multibutterfly network in O(log N) time. After reconfiguration, the multibutterfly can tolerate f worstcase faults and still route any permutation between some set of N  O(f) inputs and N  O(f) outputs in O(log N) time."
A natural randomization strategy for multicommodity flow and related algorithms by
Andrew V Goldberg(
Book
)
5 editions published in 1991 in English and held by 13 WorldCat member libraries worldwide
Abstract: "We consider the approximation algorithm of Leighton et. al. [8] for the multicommodity flow problem. We give a more natural randomization strategy that is simpler than the one in [8] and results in a better running time. This strategy also applies to several related algorithms."
5 editions published in 1991 in English and held by 13 WorldCat member libraries worldwide
Abstract: "We consider the approximation algorithm of Leighton et. al. [8] for the multicommodity flow problem. We give a more natural randomization strategy that is simpler than the one in [8] and results in a better running time. This strategy also applies to several related algorithms."
Tight bounds on the number of minimummean cycle cancellations by
Tomasz Radzik(
Book
)
4 editions published in 1990 in English and held by 13 WorldCat member libraries worldwide
Abstract: "We prove a tight [theta](min(nm log(nC), nm²)) bound on the number of iterations of the minimummean cycle canceling algorithm of Goldberg and Tarjan [12]. We do this by giving the lower bound and by improving the strongly polynomial upper bound on the number of iterations to O(nm²). We also give an improved version of the maximummean cut canceling algorithm of [6], which is a dual of the minimummean cycle canceling algorithm. Our version of the dual algorithm runs in O(nm²) iterations."
4 editions published in 1990 in English and held by 13 WorldCat member libraries worldwide
Abstract: "We prove a tight [theta](min(nm log(nC), nm²)) bound on the number of iterations of the minimummean cycle canceling algorithm of Goldberg and Tarjan [12]. We do this by giving the lower bound and by improving the strongly polynomial upper bound on the number of iterations to O(nm²). We also give an improved version of the maximummean cut canceling algorithm of [6], which is a dual of the minimummean cycle canceling algorithm. Our version of the dual algorithm runs in O(nm²) iterations."
Combinatorial optimization : lecture notes for CS363/OR349 by
Andrew V Goldberg(
Book
)
6 editions published between 1991 and 1993 in English and held by 13 WorldCat member libraries worldwide
6 editions published between 1991 and 1993 in English and held by 13 WorldCat member libraries worldwide
Scaling algorithms for the shortest paths problem by
Andrew V Goldberg(
Book
)
5 editions published in 1992 in English and held by 12 WorldCat member libraries worldwide
Abstract: "We give an O([square root of n]m log N) algorithm for the singlesource shortest paths problem with integral arc lengths. (Here n and m is the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length.) This improves previous bounds for the problem."
5 editions published in 1992 in English and held by 12 WorldCat member libraries worldwide
Abstract: "We give an O([square root of n]m log N) algorithm for the singlesource shortest paths problem with integral arc lengths. (Here n and m is the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length.) This improves previous bounds for the problem."
Implementing the pushrelabel method for the maximum flow problem on a Connection Machine by F Alizadeh(
Book
)
5 editions published in 1992 in English and held by 12 WorldCat member libraries worldwide
Abstract: "This paper describes an implementation of the Push Relabel method for the Maximum Flow problem on a Connection Machine and gives computation times of the implementation on several classes of problems."
5 editions published in 1992 in English and held by 12 WorldCat member libraries worldwide
Abstract: "This paper describes an implementation of the Push Relabel method for the Maximum Flow problem on a Connection Machine and gives computation times of the implementation on several classes of problems."
Transitive fork environments and minimum cost multiflows by
Andrew V Goldberg(
Book
)
4 editions published in 1993 in English and held by 11 WorldCat member libraries worldwide
4 editions published in 1993 in English and held by 11 WorldCat member libraries worldwide
Approximating matchings in parallel by
Edward F Fischer(
Book
)
5 editions published in 1991 in English and held by 10 WorldCat member libraries worldwide
Abstract: "We show that for any constant k> 0, a matching with cardinality at least [formula] times the maximum can be computed in NC."
5 editions published in 1991 in English and held by 10 WorldCat member libraries worldwide
Abstract: "We show that for any constant k> 0, a matching with cardinality at least [formula] times the maximum can be computed in NC."
On implementing pushrelabel method for the maximum flow problem by
B. V Cherkasskiĭ(
Book
)
3 editions published in 1994 in English and held by 10 WorldCat member libraries worldwide
Abstract: "We study efficient implementations of the pushrelabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of problems for which all known methods seem to have almost quadratic time growth rate."
3 editions published in 1994 in English and held by 10 WorldCat member libraries worldwide
Abstract: "We study efficient implementations of the pushrelabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of problems for which all known methods seem to have almost quadratic time growth rate."
On implementing scaling pushrelabel algorithms for the minimum cost flow problem by
Andrew V Goldberg(
Book
)
2 editions published in 1992 in English and held by 10 WorldCat member libraries worldwide
Abstract: "The invention of the scaling pushrelabel method is an important theoretical development in the area of minimumcost flow algorithm. In this paper we study implementations of this method. We are especially interested in heuristics that improve the performance of the algorithms in practice. Our results show that the technique works well on several problem classes with very different network structure. We also find a problem class on which the method does not perform as well and suggest directions for further improvement."
2 editions published in 1992 in English and held by 10 WorldCat member libraries worldwide
Abstract: "The invention of the scaling pushrelabel method is an important theoretical development in the area of minimumcost flow algorithm. In this paper we study implementations of this method. We are especially interested in heuristics that improve the performance of the algorithms in practice. Our results show that the technique works well on several problem classes with very different network structure. We also find a problem class on which the method does not perform as well and suggest directions for further improvement."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Artificial intelligence Business mathematics Combinatorial analysisData processing Combinatorial optimization Computational complexity Computer algorithms Computer networks Computer science Computer scienceMathematics Computer software Connection machines Data structures (Computer science) Electronic data processing Foreign exchangeLinear programming Foreign exchangeMathematical models Graph theory Graph theoryData processing Interiorpoint methods Linear programming Management scienceMathematical models Matching theory Mathematical optimization Mathematical optimizationData processing Multiprocessors Network analysis (Planning) Numerical analysis Operations research Parallel algorithms Parallel computers Parallel processing (Electronic computers) Parallel programming (Computer science) Programming (Mathematics) Program transformation (Computer programming) SecuritiesPricesLinear programming SecuritiesPricesMathematical models Sequential processing (Computer science) Software engineering StocksPricesMathematical models System theory
Alternative Names
Andrew V. Goldberg American computer scientist
Andrew V. Goldberg Amerikaans informaticus
Goldberg, A. V.
Goldberg, A. V. (Andrew V.)
Goldberg, Andrew
Languages
Covers