default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid L. Applegate
Person information
- affiliation: Google, USA
- affiliation: AT&T Labs, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]David L. Applegate, Mateo Díaz, Haihao Lu, Miles Lubin:
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming. SIAM J. Optim. 34(1): 459-484 (2024)- 2023
- [j16]David L. Applegate, Oliver Hinder
, Haihao Lu, Miles Lubin:
Faster first-order primal-dual methods for linear programming using restarts and sharpness. Math. Program. 201(1): 133-184 (2023) - 2021
- [c20]David L. Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O'Donoghue, Warren Schudy:
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient. NeurIPS 2021: 20243-20257
2010 – 2019
- 2018
- [c19]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. MobiHoc 2018: 221-230 - [i1]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. CoRR abs/1805.06420 (2018) - 2017
- [j15]Moa Apagodu, David L. Applegate, Neil J. A. Sloane, Doron Zeilberger:
Analysis of the Gift Exchange Problem. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j14]Chengwei Wang, Oliver Spatscheck, Vijay Gopalakrishnan, Yang Xu, David L. Applegate:
Toward High-Performance and Scalable Network Functions Virtualization. IEEE Internet Comput. 20(6): 10-20 (2016) - [j13]David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan:
Optimal Content Placement for a Large-Scale VoD System. IEEE/ACM Trans. Netw. 24(4): 2114-2127 (2016) - [c18]Swati Roy, David L. Applegate, Zihui Ge, Ajay Mahimkar, Shomik Pathak, Sarat C. Puthenpura:
Quantifying the service performance impact of self-organizing network actions. CNSM 2016: 37-45 - 2015
- [j12]David L. Applegate, Hans Havermann, Robert G. Selcoe, Vladimir Shevelev, Neil J. A. Sloane, Reinhard Zumkeller:
The Yellowstone Permutation. J. Integer Seq. 18(6): 15.6.7 (2015) - 2013
- [c17]David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan:
Content Placement via the Exponential Potential Function Method. IPCO 2013: 49-61 - 2012
- [c16]David L. Applegate:
Science in times of crisis: delivering situational awareness to emergency managers and the public when disaster strikes. COM.Geo 2012: 2 - [c15]Suhrid Balakrishnan, Sumit Chopra, David L. Applegate, Simon Urbanek:
Computational Television Advertising. ICDM 2012: 71-80 - [c14]Kyung-Wook Hwang, David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, Vishal Misra, K. K. Ramakrishnan, Deborah F. Swayne:
Leveraging Video Viewing Patterns for Optimal Content Placement. Networking (2) 2012: 44-58 - [c13]Suhrid Balakrishnan, Rensheng Wang, Carlos Eduardo Scheidegger, Angus MacLellan, Yifan Hu, Aaron Archer, Shankar Krishnan, David L. Applegate, Guangqin Ma, S. Tom Au:
Combining Predictors for Recommending Music: the False Positives' approach to KDD Cup track 2. KDD Cup 2012: 199-213 - 2011
- [c12]David L. Applegate, Tamraparni Dasu, Shankar Krishnan, Simon Urbanek:
Unsupervised clustering of multidimensional distributions using earth mover distance. KDD 2011: 636-644 - 2010
- [c11]David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan:
Optimal content placement for a large-scale VoD system. CoNEXT 2010: 4
2000 – 2009
- 2009
- [j11]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009) - [p1]David L. Applegate, Marc LeBrun, Neil J. A. Sloane:
Descending Dungeons and Iterated Base-Changing. The Mathematics of Preference, Choice and Order 2009: 393-402 - 2007
- [j10]David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza:
Exact solutions to linear programming problems. Oper. Res. Lett. 35(6): 693-699 (2007) - [j9]Marc LeBrun, David L. Applegate, Neil J. A. Sloane:
Problem 11286. Am. Math. Mon. 114(4): 358 (2007) - [c10]David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang:
Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075 - 2006
- [j8]David L. Applegate, Edith Cohen:
Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw. 14(6): 1193-1206 (2006) - 2004
- [c9]David L. Applegate, Lee Breslau, Edith Cohen:
Coping with network failures: routing strategies for optimal demand oblivious restoration. SIGMETRICS 2004: 270-281 - 2003
- [j7]David L. Applegate, William J. Cook, André Rohe:
Chained Lin-Kernighan for Large Traveling Salesman Problems. INFORMS J. Comput. 15(1): 82-92 (2003) - [j6]David L. Applegate, Jeffrey C. Lagarias:
Lower bounds for the total stopping time of 3x + 1 iterates. Math. Comput. 72(242): 1035-1049 (2003) - [j5]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97(1-2): 91-153 (2003) - [c8]David L. Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor:
The Cutting-Stock Approach to Bin Packing: Theory and Experiments. ALENEX 2003: 1-15 - [c7]David L. Applegate, Mikkel Thorup:
Load optimal MPLS routing with N+M labels. INFOCOM 2003: 555-565 - [c6]David L. Applegate, Edith Cohen:
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. SIGCOMM 2003: 313-324 - 2002
- [j4]David L. Applegate, William J. Cook, Sanjeeb Dash, André Rohe:
Solution of a Min-Max Vehicle Routing Problem. INFORMS J. Comput. 14(2): 132-143 (2002) - [c5]Ranjan V. Sonalkar, David L. Applegate:
Shannon capacity of frequency-overlapped digital subscriber loop channels. ICC 2002: 1741-1745 - 2001
- [c4]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization 2001: 261-304 - 2000
- [c3]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
Cutting planes and the traveling salesman problem (abstract only). SODA 2000: 429
1990 – 1999
- 1995
- [j3]David L. Applegate, Jeffrey C. Lagarias:
The Distribution of 3x+1 Trees. Exp. Math. 4(3): 193-209 (1995) - 1991
- [j2]David L. Applegate, William J. Cook:
A Computational Study of the Job-Shop Scheduling Problem. INFORMS J. Comput. 3(2): 149-156 (1991) - [j1]David L. Applegate, William J. Cook, S. Thomas McCormick:
Integral infeasibility and testing total dual integrality. Oper. Res. Lett. 10(1): 37-41 (1991) - [c2]David L. Applegate, William J. Cook:
Solving Large-Scale Matching Problems. Network Flows And Matching 1991: 557-576 - [c1]David L. Applegate, Ravi Kannan:
Sampling and Integration of Near Log-Concave functions. STOC 1991: 156-163
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
