Andrew V. Goldberg

Publication Activity (10 Years)

Years Active: 1984-2022
Publications (10 Years): 9

Top Venues

CoRR

ESA

SEA

ICALP (1)

Publications

Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA (2022)
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR (2022)
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
New instances for maximum weight independent set from a vehicle routing application. CoRR (2021)
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum 2 (4) (2021)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
Customizable Route Planning in Road Networks. Transp. Sci. 51 (2) (2017)
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan
Minimum-Cost Flows in Unit-Capacity Networks. Theory Comput. Syst. 61 (4) (2017)
Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63 (5) (2016)
Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13 (1) (2016)
Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA (2016)
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA (2015)
Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
On the Complexity of Hub Labeling. CoRR (2015)
Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
An exact combinatorial algorithm for minimum graph bisection. Math. Program. 153 (2) (2015)
Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) (2015)
Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan
Minimum Cost Flows in Graphs with Unit Capacities. STACS (2015)
Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
Route Planning in Transportation Networks. CoRR (2015)
Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck
Navigation made personal: inferring driving preferences from GPS traces. SIGSPATIAL/GIS (2015)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
Robust Distance Queries on Massive Networks. ESA (2014)
Andrew V. Goldberg, Robert Endre Tarjan
Efficient maximum flow algorithms. Commun. ACM 57 (8) (2014)
Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck
Hub Labels: Theory and Practice. SEA (2014)
Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
Algorithms for Hub Label Optimization. ICALP (1) (2013)
Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
Separating Hierarchical and General Hub Labelings. MFCS (2013)
Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN (2013)
Andrew V. Goldberg
The Hub Labeling Algorithm. SEA (2013)
Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner
Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3 (9) (2013)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
Customizable Route Planning in Road Networks (Extended Abstract). SOCS (2013)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013)
Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck
PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. 73 (7) (2013)
Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
Separating Hierarchical and General Hub Labelings CoRR (2013)
Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
Hub Label Compression. SEA (2013)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Hierarchical Hub Labelings for Shortest Paths. ESA (2012)
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX (2012)
Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
HLDB: location-based services in databases. SIGSPATIAL/GIS (2012)
Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Faster Batched Shortest Paths in Road Networks. ATMOS (2011)
Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck
Customizable Route Planning. SEA (2011)
Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan
Derandomization of auctions. Games Econ. Behav. 72 (1) (2011)
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck
Maximum Flows by Incremental Breadth-First Search. ESA (2011)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA (2011)
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
Graph Partitioning with Natural Cuts. IPDPS (2011)
Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. 53 (6) (2011)
Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck
PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS (2011)
Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
VC-Dimension and Shortest Path Algorithms. ICALP (1) (2011)
Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA (2010)
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
Alternative Routes in Road Networks. SEA (2010)
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics 14 (2009)
Andrew V. Goldberg
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. AAIM (2009)
Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX (2009)
Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg
Quincy: fair scheduling for distributed computing clusters. SOSP (2009)
Andrew V. Goldberg
A Practical Shortest Path Algorithm with Linear Expected Time. SIAM J. Comput. 37 (5) (2008)
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX (2008)
Andrew V. Goldberg
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. ESA (2008)
Andrew V. Goldberg
Point-to-Point Shortest Path Algorithms with Preprocessing. SOFSEM (1) (2007)
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
Better Landmarks Within Reach. WEA (2007)
Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA (2007)
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX (2006)
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi
Routing in Networks with Low Doubling Dimension. ICDCS (2006)
Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright
Competitive auctions. Games Econ. Behav. 55 (2) (2006)
Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem (2006)
Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan
Derandomization of auctions. STOC (2005)
Andrew V. Goldberg, Renato Fonseca F. Werneck
Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO (2005)
Andrew V. Goldberg, Jason D. Hartline
Collusion-resistant mechanisms for single-parameter agents. SODA (2005)
Andrew V. Goldberg, Chris Harrelson
search meets graph theory. SODA (2005)
Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks
A Lower Bound on the Competitive Ratio of Truthful Auctions. STACS (2004)
Andrew V. Goldberg, Alexander V. Karzanov
Maximum skew-symmetric flows and matchings. Math. Program. 100 (3) (2004)
Andrew V. Goldberg, Jason D. Hartline
Competitiveness via consensus. SODA (2003)
Cynthia Dwork, Andrew V. Goldberg, Moni Naor
On Memory-Bound Functions for Fighting Spam. CRYPTO (2003)
Andrew V. Goldberg, Jason D. Hartline
Envy-free auctions for digital goods. EC (2003)
Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
Competitive generalized auctions. STOC (2002)
Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
Truthful and Competitive Double Auctions. ESA (2002)
Andrew V. Goldberg
Shortest Path Algorithms: Engineering Aspects. ISAAC (2001)
Andrew V. Goldberg
A Simple Shortest Path Algorithm with Linear Average Time. ESA (2001)
Andrew V. Goldberg, Kostas Tsioutsiouliklis
Cut Tree Algorithms: An Experimental Study. J. Algorithms 38 (1) (2001)
Andrew V. Goldberg, Jason D. Hartline
Competitive Auctions for Multiple Digital Goods. ESA (2001)
Andrew V. Goldberg, Jason D. Hartline, Andrew Wright
Competitive auctions and digital goods. SODA (2001)
Andrew V. Goldberg, Bernard M. E. Moret
Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. SODA (1999)
Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
Buckets, Heaps, Lists, and Monotone Priority Queues. SIAM J. Comput. 28 (4) (1999)
Boris V. Cherkassky, Andrew V. Goldberg
Negative-cycle detection algorithms. Math. Program. 85 (2) (1999)
Andrew V. Goldberg, Kostas Tsioutsiouliklis
Cut Tree Algorithms. SODA (1999)
Andrew V. Goldberg
Selecting Problems for Algorithm Evaluation. WAE (1999)
Yuan Chen, Jan Edler, Andrew V. Goldberg, Allan Gottlieb, Sumeet Sobti, Peter N. Yianilos
A Prototype Implementation of Archival Intermemory. ACM DL (1999)
Andrew V. Goldberg, Satish Rao
Flows in Undirected Unit Capacity Networks. SIAM J. Discret. Math. 12 (1) (1999)
Andrew V. Goldberg, Craig Silverstein
Computational evaluation of hot queues. Data Structures, Near Neighbor Searches, and Methodology (1999)
Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin
Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. ACM J. Exp. Algorithmics 3 (1998)
Andrew V. Goldberg, Satish Rao
Beyond the Flow Decomposition Barrier. J. ACM 45 (5) (1998)
Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. IPCO (1998)
Andrew V. Goldberg, Peter N. Yianilos
Towards an Archival Intermemory. ADL (1998)
Andrew V. Goldberg
Recent Developments in Maximum Flow Algorithms (Invited Lecture). SWAT (1998)
Andrew V. Goldberg, Robert Kennedy
Global Price Updates Help. SIAM J. Discret. Math. 10 (4) (1997)
Andrew V. Goldberg, Satish Rao
Beyond the Flow Decomposition Barrier. FOCS (1997)
Andrew V. Goldberg, Alexander V. Karzanov
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. Math. Oper. Res. 22 (1) (1997)
Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
Buckets, Heaps, Lists, and Monotone Priority Queues. SODA (1997)
Boris V. Cherkassky, Andrew V. Goldberg
On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19 (4) (1997)
Andrew V. Goldberg, Satish Rao
Flows in Undirected Unit Capacity Networks. FOCS (1997)
Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, João C. Setubal, Jorge Stolfi
Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms. WAE (1997)
Andrew V. Goldberg
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. J. Algorithms 22 (1) (1997)
Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
Strategic directions in research in theory of computing. SIGACT News 28 (3) (1997)
Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein
Experimental Study of Minimum Cut Algorithms. SODA (1997)
Andrew V. Goldberg, Alexander V. Karzanov
Path Problems in Skew-Symmetric Graphs. Comb. 16 (3) (1996)
Boris V. Cherkassky, Andrew V. Goldberg
Negative-Cycle Detection Algorithms. ESA (1996)
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73 (1996)
Andrew V. Goldberg, Alexander V. Karzanov
Maximum Skew-Symmetric Flows. ESA (1995)

Andrew V. Goldberg.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrew V. Goldberg