×
Compute Distance To:
Author ID: young.neal-e Recent zbMATH articles by "Young, Neal E."
Published as: Young, Neal E.; Young, Neal; Young, N. E.; Young, N.
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

52 Publications have been cited 519 times in 426 Documents Cited by Year
Competitive paging algorithms. Zbl 0753.68018
Fiat, Amos; Karp, Richard M.; Luby, Michael; McGeoch, Lyle A.; Sleator, Daniel D.; Young, Neal E.
64
1991
Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1082.90149
Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E.
39
2004
Faster parametric shortest path and minimum-balance algorithms. Zbl 0719.90087
Young, Neal E.; Tarjan, Robert E.; Orlin, James B.
35
1991
Balancing minimum spanning trees and shortest-path trees. Zbl 0833.68096
Khuller, S.; Raghavachari, B.; Young, N.
31
1995
Randomized rounding without solving the linear program. Zbl 0849.90100
Young, Neal E.
25
1995
Approximating the minimum equivalent digraph. Zbl 0830.68100
Khuller, Samir; Raghavachari, Balaji; Young, Neal
20
1995
Approximation algorithms for covering/packing integer programs. Zbl 1082.68128
Kolliopoulos, Stavros G.; Young, Neal E.
18
2005
Low-degree spanning trees of small weight. Zbl 0849.05022
Khuller, Samir; Raghavachari, Balaji; Young, Neal
16
1996
Incremental medians via online bidding. Zbl 1216.90057
Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E.
16
2008
Simple strategies for large zero-sum games with applications to complexity theory. Zbl 1345.68175
Lipton, Richard J.; Young, Neal E.
15
1994
On-line file caching. Zbl 0994.68182
Young, N. E.
15
2002
A network-flow technique for finding low-weight bounded-degree spanning trees. Zbl 0895.68107
Fekete, Sándor P.; Khuller, Samir; Klemmstein, Monika; Raghavachari, Balaji; Young, Neal
15
1997
A new operation on sequences: The boustrophedon transform. Zbl 0858.05007
Millar, J.; Sloane, N. J. A.; Young, N. E.
15
1996
Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1285.68215
Koufogiannakis, Christos; Young, Neal E.
13
2013
Improved bicriteria existence theorems for scheduling. Zbl 1052.90549
Aslam, Javed; Rasala, April; Stein, Cliff; Young, Neal
11
1999
Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1345.90095
Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E.
10
1999
On strongly connected digraphs with bounded cycle length. Zbl 0859.05057
Khuller, Samir; Raghavachari, Balaji; Young, Neal
10
1996
On-line paging against adversarially biased random inputs. Zbl 0971.68073
Young, Neal E.
10
2000
Orienting graphs to optimize reachability. Zbl 1337.68130
Hakimi, S. Louis; Schmeichel, Edward F.; Young, Neal E.
9
1997
Distributed algorithms for covering, packing and maximum weighted matching. Zbl 1231.68276
Koufogiannakis, Christos; Young, Neal E.
9
2011
Balancing minimum spanning and shortest path trees. Zbl 0801.68134
Khuller, Samir; Raghavachari, Balaji; Young, Neal
9
1993
Greedy \(\Delta\)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1248.68561
Koufogiannakis, Christos; Young, Neal E.
9
2009
On-line file caching. Zbl 0930.68002
Young, Neal E.
8
1998
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality. Zbl 1261.68168
Koufogiannakis, Christos; Young, Neal E.
8
2009
\(K\)-medians, facility location, and the Chernoff-Wald bound. Zbl 0952.90023
Young, Neal E.
7
2000
On-line caching as cache size varies. Zbl 0800.68461
Young, Neal
7
1991
A primal-dual parallel approximation technique applied to weighted set and vertex covers. Zbl 0938.68946
Khuller, Samir; Vishkin, Uzi; Young, Neal
6
1994
Bounding the diffusive adversary. Zbl 0938.68913
Young, Neal E.
5
1998
On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 0954.90004
Klein, Philip; Young, Neal
5
1999
Designing multi-commodity flow trees. Zbl 0803.68087
Khuller, Samir; Raghavachari, Balaji; Young, Neal
5
1994
Oblivious medians via online bidding. (Extended abstract). Zbl 1145.68583
Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E.
5
2006
A nearly linear-time PTAS for explicit fractional packing and covering linear programs. Zbl 1311.90071
Koufogiannakis, Christos; Young, Neal E.
5
2014
Low degree spanning trees of small weight. Zbl 1345.90077
Khuller, Samir; Raghavachari, Balaji; Young, Neal
4
1994
Distributed and parallel algorithms for weighted vertex cover and other covering problems. Zbl 1291.05160
Koufogiannakis, Christos; Young, Neal E.
4
2009
Polynomial-time approximation scheme for data broadcast. Zbl 1296.68194
Kenyon, Claire; Schabanel, Nicolas; Young, Neal
4
2000
Optimal search trees with 2-way comparisons. Zbl 1472.68044
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
3
2015
Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1333.90015
Bienkowski, Marcin; Byrka, Jarosław; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E.
3
2015
Data collection for the sloan digital sky survey – a network-flow heuristic. Zbl 0905.68161
Lupton, Robert; Maley, F. Miller; Young, Neal
3
1998
Huffman coding with unequal letter costs. Zbl 1192.68899
Golin, Mordecai J.; Kenyon, Claire; Young, Neal E.
3
2002
The reverse greedy algorithm for the metric \(K\)-median problem. Zbl 1128.90549
Chrobak, Marek; Kenyon, Claire; Young, Neal E.
2
2005
Approximate data structures with applications. Zbl 1114.68387
Matias, Yossi; Vitter, Jeffrey Scott; Young, Neal E.
2
1994
The reverse greedy algorithm for the metric k-median problem. Zbl 1184.68631
Chrobak, Marek; Kenyon, Claire; Young, Neal
2
2006
Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1336.68289
Bienkowski, Marcin; Byrka, Jaroslaw; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E.
2
2013
The \(K\)-server dual and loose competitiveness for paging. Zbl 0800.68488
Young, Neal
2
1992
A primal-dual parallel approximation technique applied to weighted set and vertex cover. Zbl 0968.68568
Khuller, Samir; Vishkin, Uzi; Young, Neal
2
1993
Huffman coding with letter costs: a linear-time approximation scheme. Zbl 1248.94045
Golin, Mordecai J.; Mathieu, Claire; Young, Neal E.
2
2012
On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 1329.68126
Klein, Philip; Young, Neal E.
1
2015
Data collection for the Sloan digital sky survey – a network-flow heuristic. Zbl 0845.90133
Lupton, Robert; Miller Maley, F.; Young, Neal
1
1996
Prefix codes: Equiprobable words, unequal letter costs. Zbl 0876.68053
Golin, Mordecai J.; Young, Neal
1
1996
Approximating the minimum equivalent digraph. Zbl 0867.05070
Khuller, Samir; Raghavachari, Balaji; Young, Neal
1
1994
On a linear program for minimum-weight triangulation. Zbl 1311.68191
Yousefi, Arman; Young, Neal E.
1
2014
On the cost of unsuccessful searches in search trees with two-way comparisons. Zbl 07433284
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
1
2021
On the cost of unsuccessful searches in search trees with two-way comparisons. Zbl 07433284
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
1
2021
Optimal search trees with 2-way comparisons. Zbl 1472.68044
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
3
2015
Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1333.90015
Bienkowski, Marcin; Byrka, Jarosław; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E.
3
2015
On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 1329.68126
Klein, Philip; Young, Neal E.
1
2015
A nearly linear-time PTAS for explicit fractional packing and covering linear programs. Zbl 1311.90071
Koufogiannakis, Christos; Young, Neal E.
5
2014
On a linear program for minimum-weight triangulation. Zbl 1311.68191
Yousefi, Arman; Young, Neal E.
1
2014
Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1285.68215
Koufogiannakis, Christos; Young, Neal E.
13
2013
Approximation algorithms for the joint replenishment problem with deadlines. Zbl 1336.68289
Bienkowski, Marcin; Byrka, Jaroslaw; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E.
2
2013
Huffman coding with letter costs: a linear-time approximation scheme. Zbl 1248.94045
Golin, Mordecai J.; Mathieu, Claire; Young, Neal E.
2
2012
Distributed algorithms for covering, packing and maximum weighted matching. Zbl 1231.68276
Koufogiannakis, Christos; Young, Neal E.
9
2011
Greedy \(\Delta\)-approximation algorithm for covering with arbitrary constraints and submodular cost. Zbl 1248.68561
Koufogiannakis, Christos; Young, Neal E.
9
2009
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality. Zbl 1261.68168
Koufogiannakis, Christos; Young, Neal E.
8
2009
Distributed and parallel algorithms for weighted vertex cover and other covering problems. Zbl 1291.05160
Koufogiannakis, Christos; Young, Neal E.
4
2009
Incremental medians via online bidding. Zbl 1216.90057
Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E.
16
2008
Oblivious medians via online bidding. (Extended abstract). Zbl 1145.68583
Chrobak, Marek; Kenyon, Claire; Noga, John; Young, Neal E.
5
2006
The reverse greedy algorithm for the metric k-median problem. Zbl 1184.68631
Chrobak, Marek; Kenyon, Claire; Young, Neal
2
2006
Approximation algorithms for covering/packing integer programs. Zbl 1082.68128
Kolliopoulos, Stavros G.; Young, Neal E.
18
2005
The reverse greedy algorithm for the metric \(K\)-median problem. Zbl 1128.90549
Chrobak, Marek; Kenyon, Claire; Young, Neal E.
2
2005
Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1082.90149
Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E.
39
2004
On-line file caching. Zbl 0994.68182
Young, N. E.
15
2002
Huffman coding with unequal letter costs. Zbl 1192.68899
Golin, Mordecai J.; Kenyon, Claire; Young, Neal E.
3
2002
On-line paging against adversarially biased random inputs. Zbl 0971.68073
Young, Neal E.
10
2000
\(K\)-medians, facility location, and the Chernoff-Wald bound. Zbl 0952.90023
Young, Neal E.
7
2000
Polynomial-time approximation scheme for data broadcast. Zbl 1296.68194
Kenyon, Claire; Schabanel, Nicolas; Young, Neal
4
2000
Improved bicriteria existence theorems for scheduling. Zbl 1052.90549
Aslam, Javed; Rasala, April; Stein, Cliff; Young, Neal
11
1999
Rounding algorithms for a geometric embedding of minimum multiway cut. Zbl 1345.90095
Karger, David R.; Klein, Philip; Stein, Cliff; Thorup, Mikkel; Young, Neal E.
10
1999
On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Zbl 0954.90004
Klein, Philip; Young, Neal
5
1999
On-line file caching. Zbl 0930.68002
Young, Neal E.
8
1998
Bounding the diffusive adversary. Zbl 0938.68913
Young, Neal E.
5
1998
Data collection for the sloan digital sky survey – a network-flow heuristic. Zbl 0905.68161
Lupton, Robert; Maley, F. Miller; Young, Neal
3
1998
A network-flow technique for finding low-weight bounded-degree spanning trees. Zbl 0895.68107
Fekete, Sándor P.; Khuller, Samir; Klemmstein, Monika; Raghavachari, Balaji; Young, Neal
15
1997
Orienting graphs to optimize reachability. Zbl 1337.68130
Hakimi, S. Louis; Schmeichel, Edward F.; Young, Neal E.
9
1997
Low-degree spanning trees of small weight. Zbl 0849.05022
Khuller, Samir; Raghavachari, Balaji; Young, Neal
16
1996
A new operation on sequences: The boustrophedon transform. Zbl 0858.05007
Millar, J.; Sloane, N. J. A.; Young, N. E.
15
1996
On strongly connected digraphs with bounded cycle length. Zbl 0859.05057
Khuller, Samir; Raghavachari, Balaji; Young, Neal
10
1996
Data collection for the Sloan digital sky survey – a network-flow heuristic. Zbl 0845.90133
Lupton, Robert; Miller Maley, F.; Young, Neal
1
1996
Prefix codes: Equiprobable words, unequal letter costs. Zbl 0876.68053
Golin, Mordecai J.; Young, Neal
1
1996
Balancing minimum spanning trees and shortest-path trees. Zbl 0833.68096
Khuller, S.; Raghavachari, B.; Young, N.
31
1995
Randomized rounding without solving the linear program. Zbl 0849.90100
Young, Neal E.
25
1995
Approximating the minimum equivalent digraph. Zbl 0830.68100
Khuller, Samir; Raghavachari, Balaji; Young, Neal
20
1995
Simple strategies for large zero-sum games with applications to complexity theory. Zbl 1345.68175
Lipton, Richard J.; Young, Neal E.
15
1994
A primal-dual parallel approximation technique applied to weighted set and vertex covers. Zbl 0938.68946
Khuller, Samir; Vishkin, Uzi; Young, Neal
6
1994
Designing multi-commodity flow trees. Zbl 0803.68087
Khuller, Samir; Raghavachari, Balaji; Young, Neal
5
1994
Low degree spanning trees of small weight. Zbl 1345.90077
Khuller, Samir; Raghavachari, Balaji; Young, Neal
4
1994
Approximate data structures with applications. Zbl 1114.68387
Matias, Yossi; Vitter, Jeffrey Scott; Young, Neal E.
2
1994
Approximating the minimum equivalent digraph. Zbl 0867.05070
Khuller, Samir; Raghavachari, Balaji; Young, Neal
1
1994
Balancing minimum spanning and shortest path trees. Zbl 0801.68134
Khuller, Samir; Raghavachari, Balaji; Young, Neal
9
1993
A primal-dual parallel approximation technique applied to weighted set and vertex cover. Zbl 0968.68568
Khuller, Samir; Vishkin, Uzi; Young, Neal
2
1993
The \(K\)-server dual and loose competitiveness for paging. Zbl 0800.68488
Young, Neal
2
1992
Competitive paging algorithms. Zbl 0753.68018
Fiat, Amos; Karp, Richard M.; Luby, Michael; McGeoch, Lyle A.; Sleator, Daniel D.; Young, Neal E.
64
1991
Faster parametric shortest path and minimum-balance algorithms. Zbl 0719.90087
Young, Neal E.; Tarjan, Robert E.; Orlin, James B.
35
1991
On-line caching as cache size varies. Zbl 0800.68461
Young, Neal
7
1991
all top 5

Cited by 873 Authors

10 Chrobak, Marek
10 Young, Neal E.
8 Epstein, Leah
6 Levin, Asaf
6 Nagamochi, Hiroshi
6 Ran, Yingli
6 Zhang, Peng
6 Zhang, Zhao
5 Angel, Eric
5 Bampis, Evripidis
5 Bérczi, Kristóf
5 Buchbinder, Niv
5 Chandrasekaran, Karthekeyan
5 Nagarajan, Viswanath
5 Ravi, Ramamoorthi
4 Bienkowski, Marcin
4 Ehrenborg, Richard
4 Fiat, Amos
4 Király, Tamás
4 Könemann, Jochen
4 Naor, Joseph Seffi
4 Noga, John
4 Pilipczuk, Marcin L.
4 Ruzika, Stefan
4 Segev, Danny
4 Sgall, Jiří
4 Thielen, Clemens
4 van Stee, Rob
3 Albers, Susanne
3 Bang-Jensen, Jørgen
3 Bein, Wolfgang W.
3 Borodin, Allan B.
3 Chekuri, Chandra S.
3 Dai, Wenqiang
3 Dorrigiv, Reza
3 Dürr, Christoph
3 Elkin, Michael
3 Even, Guy
3 Folwarczný, Lukáš
3 Fotakis, Dimitris A.
3 Golin, Mordecai J.
3 Gupta, Anupam
3 Hajiaghayi, Mohammad Taghi
3 Holzhauser, Michael
3 Ibaraki, Toshihide
3 Imreh, Csanád
3 Jansen, Klaus
3 Jeż, Łukasz
3 Kaporis, Alexis C.
3 Katz, Matthew J.
3 Khuller, Samir
3 Kolliopoulos, Stavros G.
3 Koufogiannakis, Christos
3 Královič, Rastislav
3 Kratsch, Stefan
3 Krumke, Sven Oliver
3 Leonardi, Stefano
3 López-Ortiz, Alejandro
3 Makino, Kazuhisa
3 Marx, Dániel
3 McCormick, S. Thomas
3 Molinaro, Marco
3 Morsy, Ehab
3 Moruz, Gabriel
3 Munro, J. Ian
3 Nagy-György, Judit
3 Negoescu, Andrei
3 Parekh, Ojas D.
3 Raghavachari, Balaji
3 Rawitz, Dror
3 Schmid, Stefan
3 Schwartz, Roy
3 Sharan, Roded
3 Spirakis, Paul G.
3 Vygen, Jens
3 Wahlström, Magnus
3 Zhao, Liang
2 Ageev, Aleksandr Aleksandrovich
2 Andersen, Patrick John
2 Angelopoulos, Spyros
2 Armon, Amitai
2 Ashur, Stav
2 Avidor, Adi
2 Avin, Chen
2 Bar-Noy, Amotz
2 Bartal, Yair
2 Biniaz, Ahmad
2 Böhm, Martin
2 Bonomo-Braberman, Flavia
2 Bopardikar, Shaunak D.
2 Boros, Endre
2 Boyar, Joan F.
2 Burzyn, Pablo
2 Byrka, Jarosław
2 Carmi, Paz
2 Chakaravarthy, Venkatesan T.
2 Chakrabarty, Deeparnab
2 Chan, Timothy Moon-Yew
2 Chaudhuri, Kamalika
2 Chitnis, Rajesh Hemant
...and 773 more Authors
all top 5

Cited in 88 Serials

50 Theoretical Computer Science
45 Algorithmica
33 Discrete Applied Mathematics
22 Journal of Combinatorial Optimization
21 Information Processing Letters
15 Mathematical Programming. Series A. Series B
14 Journal of Computer and System Sciences
14 Theory of Computing Systems
9 Operations Research Letters
8 SIAM Journal on Computing
8 Discrete & Computational Geometry
8 European Journal of Operational Research
6 Discrete Optimization
5 Discrete Mathematics
5 Information and Computation
5 Distributed Computing
5 Journal of Scheduling
5 Journal of Discrete Algorithms
4 Networks
4 Computers & Operations Research
4 SIAM Journal on Discrete Mathematics
4 Computational Geometry
3 Mathematics of Operations Research
3 Algorithms
2 Artificial Intelligence
2 Israel Journal of Mathematics
2 Physica A
2 Automatica
2 Computing
2 European Journal of Combinatorics
2 Annals of Operations Research
2 Real-Time Systems
2 International Journal of Computational Geometry & Applications
2 Games and Economic Behavior
2 Linear Algebra and its Applications
2 Mathematical Methods of Operations Research
2 Annals of Combinatorics
2 Optimization Letters
1 Acta Informatica
1 Journal of Mathematical Biology
1 Mathematical Methods in the Applied Sciences
1 Applied Mathematics and Computation
1 Journal of Applied Probability
1 Journal of Combinatorial Theory. Series A
1 Journal of Combinatorial Theory. Series B
1 Journal of Graph Theory
1 Operations Research
1 Ricerche di Matematica
1 Advances in Applied Mathematics
1 Annals of Pure and Applied Logic
1 Order
1 International Journal of Approximate Reasoning
1 Asia-Pacific Journal of Operational Research
1 Mathematical and Computer Modelling
1 SIAM Journal on Matrix Analysis and Applications
1 Journal of Parallel and Distributed Computing
1 The Annals of Applied Probability
1 Journal of Global Optimization
1 Aequationes Mathematicae
1 Elemente der Mathematik
1 ZOR. Zeitschrift für Operations Research
1 SIAM Journal on Optimization
1 Computational Complexity
1 SIAM Journal on Scientific Computing
1 The Electronic Journal of Combinatorics
1 Top
1 The Journal of Artificial Intelligence Research (JAIR)
1 INFORMS Journal on Computing
1 Mathematical Problems in Engineering
1 Doklady Mathematics
1 Soft Computing
1 RAIRO. Theoretical Informatics and Applications
1 Optimization and Engineering
1 Applied Sciences
1 Journal of Applied Mathematics and Computing
1 ACM Journal of Experimental Algorithmics
1 Acta Numerica
1 International Journal of Operations Research (Taichung)
1 Logical Methods in Computer Science
1 Discrete Mathematics, Algorithms and Applications
1 Mathematical Programming Computation
1 Science China. Information Sciences
1 RAIRO. Theoretical Informatics and Applications
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Theory of Computing
1 Journal of the Operations Research Society of China
1 Computer Science Review
1 ACM Transactions on Computation Theory

Citations by Year