David L. Applegate

Affiliations:
  • Google, USA
  • AT&T Labs, USA


According to our database1, David L. Applegate authored at least 37 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming.
SIAM J. Optim., March, 2024

2023
Faster first-order primal-dual methods for linear programming using restarts and sharpness.
Math. Program., 2023

2021
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2018
Wireless coverage prediction via parametric shortest paths.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

2017
Analysis of the Gift Exchange Problem.
Electron. J. Comb., 2017

2016
Optimal Content Placement for a Large-Scale VoD System.
IEEE/ACM Trans. Netw., 2016

Toward High-Performance and Scalable Network Functions Virtualization.
IEEE Internet Comput., 2016

Quantifying the service performance impact of self-organizing network actions.
Proceedings of the 12th International Conference on Network and Service Management, 2016

2015
The Yellowstone Permutation.
J. Integer Seq., 2015

2013
Content Placement via the Exponential Potential Function Method.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012
Combining Predictors for Recommending Music: the False Positives' approach to KDD Cup track 2.
Proceedings of KDD Cup 2011 competition, San Diego, CA, USA, 2011, 2012

Leveraging Video Viewing Patterns for Optimal Content Placement.
Proceedings of the NETWORKING 2012, 2012

Computational Television Advertising.
Proceedings of the 12th IEEE International Conference on Data Mining, 2012

Science in times of crisis: delivering situational awareness to emergency managers and the public when disaster strikes.
Proceedings of the 3rd International Conference on Computing for Geospatial Research and Application, 2012

2011
Unsupervised clustering of multidimensional distributions using earth mover distance.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2009
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett., 2009

Descending Dungeons and Iterated Base-Changing.
Proceedings of the Mathematics of Preference, Choice and Order, 2009

2007
Problem 11286.
Am. Math. Mon., 2007

Exact solutions to linear programming problems.
Oper. Res. Lett., 2007

Compressing rectilinear pictures and minimizing access control lists.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Making routing robust to changing traffic demands: algorithms and evaluation.
IEEE/ACM Trans. Netw., 2006

2004
Coping with network failures: routing strategies for optimal demand oblivious restoration.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2004

2003
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.
Math. Program., 2003

Lower bounds for the total stopping time of 3x + 1 iterates.
Math. Comput., 2003

Chained Lin-Kernighan for Large Traveling Salesman Problems.
INFORMS J. Comput., 2003

Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs.
Proceedings of the ACM SIGCOMM 2003 Conference on Applications, 2003

Load optimal MPLS routing with N+M labels.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

The Cutting-Stock Approach to Bin Packing: Theory and Experiments.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
Solution of a Min-Max Vehicle Routing Problem.
INFORMS J. Comput., 2002

Shannon capacity of frequency-overlapped digital subscriber loop channels.
Proceedings of the IEEE International Conference on Communications, 2002

2001
TSP Cuts Which Do Not Conform to the Template Paradigm.
Proceedings of the Computational Combinatorial Optimization, 2001

2000
Cutting planes and the traveling salesman problem (abstract only).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1995
The Distribution of 3x+1 Trees.
Exp. Math., 1995

1991
Integral infeasibility and testing total dual integrality.
Oper. Res. Lett., 1991

A Computational Study of the Job-Shop Scheduling Problem.
INFORMS J. Comput., 1991

Sampling and Integration of Near Log-Concave functions
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Solving Large-Scale Matching Problems.
Proceedings of the Network Flows And Matching, 1991


  Loading...