WorldCat Identities

Goldberg, Andrew V.

Overview
Works: 42 works in 52 publications in 1 language and 139 library holdings
Genres: Conference proceedings 
Roles: Author, Editor
Classifications: QA402.5, 519.64
Publication Timeline
Key
Publications about  Andrew V Goldberg Publications about Andrew V Goldberg
Publications by  Andrew V Goldberg Publications by Andrew V Goldberg
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 81 WorldCat member libraries worldwide
Tight bounds on the number of minimum-mean 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 minimum-mean 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 maximum-mean cut canceling algorithm of [6], which is a dual of the minimum-mean cycle canceling algorithm. Our version of the dual algorithm runs in O(nm²) iterations."
Path problems in skew-symmetric graphs by Andrew V Goldberg ( Book )
2 editions published in 1993 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive with the fastest algorithms for the standard problems."
Transitive folk environments and minimum cost multiflows by Stanford University ( Book )
1 edition published in 1993 in English and held by 2 WorldCat member libraries worldwide
Sublinear-time parallel algorithms for matching and related problems by Andrew V Goldberg ( Book )
2 editions published in 1988 in English and held by 2 WorldCat member libraries worldwide
This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one 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 node-disjoint 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 sublinear-time deterministic parallel algorithms for dining a minimum-weight bipartite matching and for finding a minimum-cost flow in a network with zero-one capacities, if the weights are polynomially bounded integers. Keywords: Network flows. (KR)
Combinatorial algorithms for the generalized circulation problem by Andrew V Goldberg ( Book )
2 editions published in 1988 in English and held by 2 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)
Finding minimum-cost flows by double scaling by Ravindra K Ahuja ( Book )
2 editions published in 1988 in Undetermined and English and held by 2 WorldCat member libraries worldwide
Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm log log U(nC)) time on networks with n vertices, m arcs, maximum arc capacity U, and maximum arc cost magnitude C. The major techniques used are the capacity-scaling approach of Edmonds and Karp, the excess-scaling approach of Ahuja and Orlin, the cost-scaling approach of Goldberg and Tarjan, and the dynamic tree data structure of Sleator and Tarjan. For nonsparse graphs with large maximum arc capacity, we obtain a similar but slightly better bound. We also obtain a slightly better bound for the (uncapacitated) transportation problem. In addition, we discuss a capacity-bounding approach to the minimum cost flow problem. (KR)
Shortest paths algorithms : theory and experimental evaluation by B. V Cherkassky ( Book )
2 editions published in 1993 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research."
Global price updates help by Andrew V Goldberg ( Book )
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
Abstract: "Periodic global updates of dual variables have been shown to yield a susbtantial speed advantage in implementations of push- relabel algorithms for the maximum flow and minimum cost flow problems. In this paper, we show that in the context of the bipartite matching and assignment problems, global updates yield a theoretical improvement as well. For bipartite matching, a push-relabel algorithm that matches the best bound when global updates are used achieves a bound that is worse by a factor of [square root of n] without the updates. A similar result holds for the assignment problem."
Book review : Flow algorithms by G.M. Adelʹson-Velʹski, E.A. Dinic, and A.V. Karzanov by Andrew V Goldberg ( Book )
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
This is a review of the book "Flow Algorithms" by Adel'son-Vel'ski, Dinic, and Karzanov, well-known researchers in the area of algorithm design and analysis. This remarkable book, published in 1975, is written in Russian and has never been translated into English. What is remarkable about the book is that it describes many major results obtained in the Soviet Union (and originally published in papers by 1976) that were independently discovered later (and in some cases much later) in the West. The book also contains some minor results that we believe are still unknown in the West. The book is well-written and a pleasure to read, at least for someone fluent in Russian. Although the book is fifteen years old and we believe that all the major results contained in it are known in the West by now, the book is still of great historical importance. Hence a complete review is in order. (from the Introduction)
Finding minimum-cost ciculations by successive approximation by Princeton University ( Book )
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
Processor-efficient implementation of a maximum flow algorithm by Andrew V Goldberg ( Book )
1 edition published in 1990 in English and held by 1 WorldCat member library worldwide
In this paper we describe two processor-efficient 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
Finding minimum-cost circulations by successive approximation by Andrew V Goldberg ( Book )
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
Approximating matchings in parallel by Ted Fischer ( Book )
1 edition published in 1991 in English and held by 1 WorldCat member library 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."
A heuristic improvement of the Bellman-Ford algorit[h]m by Andrew V Goldberg ( Book )
1 edition published in 1993 in English and held by 1 WorldCat member library worldwide
Abstract: "We describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is superior in practice."
An efficient cost scaling algorithm for the assignment problem by Andrew V Goldberg ( Book )
1 edition published in 1993 in English and held by 1 WorldCat member library worldwide
Abstract: "The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem. We investigate implementations of the method that take advantage of the problem structure. The results show that the method is very promising for practical use; it outperforms all other codes in almost all problems in our study."
Finding minimum-cost circulations by canceling negative cycles by Andrew V Goldberg ( Book )
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
Interior-point methods in parallel computation by Andrew V Goldberg ( Book )
1 edition published in 1989 in English and held by 1 WorldCat member library worldwide
Ln this paper we use interior-point 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 zero-one minimum-cost flow problem, yielding $O[superscript]n$((SQRT m) log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interior-point methods in the context of parallel algorithm design
On implementing push-relabel method for the maximum flow problem by B. V Cherkasskiĭ ( Book )
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
Abstract: "We study efficient implementations of the push-relabel 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."
Parallel (delta + 1) coloring of constant-degree graphs by Andrew V Goldberg ( Book )
1 edition published in 1986 in English and held by 1 WorldCat member library worldwide
This paper presents parallel algorithms for coloring a constant-degree graph with a maximum degree of delta in (delta + 1) colors and for finding a maximal independent set in a constant-degree graph. Given a graph with n vertices, the algorithms run in O (lg*n) time on EREW PRAM with O(n) processors. The algorithms use only local communication and achieve the same complexity bounds when implemented in the distributed model of parallel computation
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.88 (from 0.47 for Transitive ... to 0.92 for The shorte ...)
Alternative Names
Goldberg, A. V.
Goldberg, A. V. (Andrew V.)
Goldberg, Andrew
Languages
English (29)
Covers