Person:536068

Available identifiers

zbMath Open goldberg.andrew-vMaRDI QIDQ536068

List of research outcomes

Publication	Date of Publication	Type
Maximum skew-symmetric flows	2023-05-08	Paper
Recent developments in maximum flow algorithms	2022-12-09	Paper
On implementing push-relabel method for the maximum flow problem	2022-08-30	Paper
New instances for maximum weight independent set from a vehicle routing application	2021-11-08	Paper
Exact Combinatorial Branch-and-Bound for Graph Bisection	2019-09-12	Paper
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms	2019-09-11	Paper
Shortest Path Feasibility Algorithms: An Experimental Evaluation	2019-09-11	Paper
An Experimental Study of Minimum Mean Cycle Algorithms	2019-09-11	Paper
Algorithms for Hub Label Optimization	2018-11-05	Paper
Highway Dimension and Provably Efficient Shortest Path Algorithms	2018-08-02	Paper
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs	2018-07-16	Paper
Minimum-cost flows in unit-capacity networks	2018-02-01	Paper
Negative-cycle detection algorithms	2017-12-05	Paper
https://portal.mardi4nfdi.de/entity/Q2955012	2017-01-24	Paper
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search	2015-11-19	Paper
An exact combinatorial algorithm for minimum graph bisection	2015-10-19	Paper
On the Complexity of Hub Labeling (Extended Abstract)	2015-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q5501784	2015-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q5501810	2015-08-14	Paper
Alternative routes in road networks	2015-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q2921666	2014-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q2921720	2014-10-13	Paper
Robust Distance Queries on Massive Networks	2014-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q5417667	2014-05-22	Paper
Shortest-path feasibility algorithms	2014-04-01	Paper
Separating Hierarchical and General Hub Labelings	2013-09-20	Paper
Algorithms for Hub Label Optimization	2013-08-06	Paper
Hierarchical Hub Labelings for Shortest Paths	2012-09-25	Paper
Maximum Flows by Incremental Breadth-First Search	2011-09-16	Paper
VC-Dimension and Shortest Path Algorithms	2011-07-06	Paper
Derandomization of auctions	2011-05-16	Paper
Derandomization of auctions	2010-08-16	Paper
Competitive generalized auctions	2010-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q3574264	2010-07-09	Paper
The Partial Augment–Relabel Algorithm for the Maximum Flow Problem	2008-11-25	Paper
A Practical Shortest Path Algorithm with Linear Expected Time	2008-10-28	Paper
Point-to-Point Shortest Path Algorithms with Preprocessing	2008-03-07	Paper
STACS 2004	2007-10-01	Paper
Maximum skew-symmetric flows and matchings	2004-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4474117	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4471297	2004-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4460267	2004-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4411372	2003-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4796178	2003-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q4796192	2003-03-02	Paper
Cut Tree Algorithms: An Experimental Study	2001-04-17	Paper
Negative-cycle detection algorithms	2001-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q4234147	1999-11-02	Paper
Buckets, Heaps, Lists, and Monotone Priority Queues	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4252406	1999-09-15	Paper
https://portal.mardi4nfdi.de/entity/Q4252310	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4363173	1998-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q3840370	1998-08-10	Paper
On implementing the push-relabel method for the maximum flow problem	1998-05-26	Paper
Path problems in skew-symmetric graphs	1997-08-03	Paper
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost	1997-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q3128880	1997-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q3128914	1997-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q3128915	1997-04-23	Paper
Shortest paths algorithms: Theory and experimental evaluation	1996-10-20	Paper
Scaling Algorithms for the Shortest Paths Problem	1995-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q3140424	1994-12-04	Paper
Tight bounds on the number of minimum-mean cycle cancellations and related results	1994-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q4283437	1994-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q4283440	1994-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q3138945	1993-10-20	Paper
Approximating matchings in parallel	1993-09-16	Paper
A heuristic improvement of the Bellman-Ford algorithm	1993-08-19	Paper
Sublinear-Time Parallel Algorithms for Matching and Related Problems	1993-05-16	Paper
A natural randomization strategy for multicommodity flow and related algorithms	1993-01-16	Paper
Finding minimum-cost flows by double scaling	1992-06-28	Paper
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems	1992-06-28	Paper
Processor-efficient implementation of a maximum flow algorithm	1992-06-26	Paper
Use of dynamic trees in a network simplex algorithm for the maximum flow problem	1992-06-25	Paper
Compression and Ranking	1992-06-25	Paper
Combinatorial Algorithms for the Generalized Circulation Problem	1991-01-01	Paper
Finding Minimum-Cost Circulations by Successive Approximation	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3352816	1990-01-01	Paper
A parallel algorithm for finding a blocking flow in an acyclic network	1989-01-01	Paper
Finding minimum-cost circulations by canceling negative cycles	1989-01-01	Paper
A new approach to the maximum-flow problem	1988-01-01	Paper
Parallel Symmetry-Breaking in Sparse Graphs	1988-01-01	Paper
Parallel \((\Delta +1)\)-coloring of constant-degree graphs	1987-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Andrew V. Goldberg