AI & ChatGPT searches , social queries for DAVID SHMOYS
Search references for DAVID SHMOYS. Phrases containing DAVID SHMOYS
See searches and references containing DAVID SHMOYS!
Search references for DAVID SHMOYS. Phrases containing DAVID SHMOYS
See searches and references containing DAVID SHMOYS!DAVID SHMOYS
American mathematician
David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science
David_Shmoys
Israeli mathematician and management scientist (born 1971)
and mathematical programming in 2005 under professors Robin Roundy and David Shmoys. His dissertation was entitled "Computing Provably Near-Optimal Policies
Retsef_Levi
American computer scientist (1933–1994)
D. Shmoys, Wiley, 1985, ISBN 978-0-471-90413-7). Selected publications of Eugene L. Lawler (K. Aardal, J. K. Lenstra, F. Maffioli, and D. Shmoys, eds
Eugene_Lawler
Professor of computer science
probabilistic methods, data science Institutions University of Maryland, College Park Doctoral advisor David Shmoys Website https://www.cs.umd.edu/~srin/
Aravind_Srinivasan
American computer scientist (born 1965)
University Dartmouth College Thesis Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems (1992) Doctoral advisor David Shmoys
Clifford_Stein
Hungarian mathematician
dedicated mentoring and service to these communities." Tardos is married to David Shmoys, a fellow professor at Cornell. Her younger brother, Gábor Tardos, is
Éva_Tardos
IEEE conference for theoretical computer science
Chair) Philadelphia Paul Beame (TCMF Chair) 2009 Dan Spielman (PC Chair), David Shmoys (General co-Chair), Milena Mihail (Local Chair), Prasad Tetali (Local
Symposium on Foundations of Computer Science
Symposium_on_Foundations_of_Computer_Science
Combinatorial optimization problem
algorithm, which is a 3-approximation algorithm Formally characterized by David Shmoys in 1995, the Sh algorithm takes as input a complete undirected graph
Metric_k-center
Award
awarded 2010 Not awarded 2011 David Easley and Jon Kleinberg 2012 Not awarded 2013 David P. Williamson and David Shmoys 2014 Not awarded 2015 Michele
Frederick_W._Lanchester_Prize
Optimization problem
different problem, known as the bin packing problem.) Dorit S. Hochbaum and David Shmoys presented a polynomial-time approximation scheme in 1987 that finds an
Job-shop_scheduling
songwriter David Shmoys (born 1959), American professor David Shoebridge, Australian politician David Shofet, Iranian-American rabbi David Sholtz (1891–1953)
List of people with given name David
List_of_people_with_given_name_David
The team is led by: Carla P. Gomes, Cornell University (Director ICS) David Shmoys, Cornell University (Associate Director ICS) Thomas Dietterich, Oregon
Institute for Computational Sustainability
Institute_for_Computational_Sustainability
Nir Shavit Scott Shenker G. C. Shephard Lawrence Shepp Goro Shimura David Shmoys Peter Shor Richard Shore Robert Shostak S. S. Shrikhande Wacław Sierpiński
List of people by Erdős number
List_of_people_by_Erdős_number
Past and present Cornell University faculty
Senior Science Award (1988), the ASIS Award of Merit (1989); ACM Fellow David Shmoys (professor of Operations Research and Information Engineering) — ACM
List of Cornell University faculty
List_of_Cornell_University_faculty
American computer scientist
Jan Karel; Shmoys, David (2009), "The traveling salesman problem: a computational study", SIAM Review, 51 (4): 799–801, MR 2573947 David Applegate publications
David_Applegate
2011 book by William J. Cook
algorithms will find much of value in this book". Jan Karel Lenstra and David Shmoys write that "The writing is relaxed and entertaining; the presentation
In Pursuit of the Traveling Salesman
In_Pursuit_of_the_Traveling_Salesman
Theorem on Hamiltonian graphs
doi:10.1016/0095-8956(76)90061-7, MR 0416980. Hochbaum, Dorit S.; Shmoys, David B. (1986), "A unified approach to approximation algorithms for bottleneck
Fleischner's_theorem
Class of algorithms that find approximate solutions to optimization problems
Notions of Approximations: Good, Better, Best, and More Williamson, David P.; Shmoys, David B. (April 26, 2011), The Design of Approximation Algorithms, Cambridge
Approximation_algorithm
Dutch mathematician and operations researcher
Eugene L. Lawler, Jan Karel Lenstra, Alexander H.G. Rinnooy Kan, David B. Shmoys (eds.). The traveling salesman problem; a guided tour of combinatorial
Jan_Karel_Lenstra
Complexity class
cosrev.2009.11.001. Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.; Shmoys, D. B. (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial
NP-hardness
on Discrete Algorithms was held in 1990 at San Francisco, organized by David Johnson. In 2012, the ACM Special Interest Group on Algorithms and Computation
Symposium on Discrete Algorithms
Symposium_on_Discrete_Algorithms
Hebrew curse
including Yiddish, for example, "Dos iz a kol-boynik, yemakh-shmoy!" ("He is a scoundrel, yemakh-shmoy!") and English. When the phrase is used in English of
Yimakh_shemo
Indian American professor of computer science (born 1957)
1145/375827.375845, MR 1868717, S2CID 2353092. See Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University
Vijay_Vazirani
Optimization prpblem
116–127. doi:10.1145/321921.321934. ISSN 0004-5411. Hochbaum, Dorit S.; Shmoys, David B. (1987-01-01). "Using dual approximation algorithms for scheduling
Uniform-machines_scheduling
Assignment of colors to edges of a graph
New York: Wiley-Interscience, ISBN 0-471-02865-7. Karloff, Howard J.; Shmoys, David B. (1987), "Efficient parallel algorithms for edge coloring problems"
Edge_coloring
Dutch politician (born 1949)
Combinatorial Optimization. With Eugene L. Lawler, Jan Karel Lenstra, and David B. Shmoys. John Wiley & Sons, New York, NY. 1993, Handbooks in Operations Research
Alexander_Rinnooy_Kan
Unsolved problem in parallel algorithms
(2014), "Parallel algorithms for geometric graph problems" (PDF), in Shmoys, David B. (ed.), Symposium on Theory of Computing, STOC 2014, New York, NY
1-vs-2_cycles_problem
Mexican-American computer scientist (born 1948)
Teofilo F. Gonzalez at the Mathematics Genealogy Project Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University
Teofilo_F._Gonzalez
3467555. ISBN 978-1-4503-8554-1. S2CID 195874333. Hochbaum, Dorit S.; Shmoys, David B. (1987-01-01). "Using dual approximation algorithms for scheduling
Identical-machines_scheduling
Classical problem in combinatorics
{{citation}}: Check |isbn= value: checksum (help) Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University
Set_cover_problem
NP-hard problem in combinatorial optimization
Optimisation (PDF), John Wiley and Sons Ltd., pp. 215–310 Lawler, E. L.; Shmoys, D. B.; Kan, A. H. G. Rinnooy; Lenstra, J. K. (1985). The Traveling Salesman
Travelling_salesman_problem
Freeman and Company. p. 238. ISBN 978-0716710448. Hochbaum, Dorit S.; Shmoys, David B. (1987-01-01). "Using dual approximation algorithms for scheduling
Multiway_number_partitioning
Optimization problem
Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys (1993-01-01). "Chapter 9 Sequencing and scheduling: Algorithms and
Optimal_job_scheduling
Optimization problem in computer science and operations research
1145/321941.321951. ISSN 0004-5411. S2CID 18693114. Lenstra, Jan Karel; Shmoys, David B.; Tardos, Éva (1990-01-01). "Approximation algorithms for scheduling
Unrelated-machines_scheduling
Optimization problem in computer science
the ACM. 3 (6): 347–350. doi:10.1145/367297.367317. S2CID 14701351. Shmoys, David; Tardos, Eva (1993). "An approximation algorithm for the generalized
Parallel_task_scheduling
Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys (1993-01-01). "Chapter 9 Sequencing and scheduling: Algorithms and
Single-machine_scheduling
Data structure for integer priorities
MR 0955149 Dinur, Irit; Steurer, David (2014), "Analytical approach to parallel repetition", in Shmoys, David B. (ed.), Symposium on Theory of Computing
Bucket_queue
Graph drawing with vertices on a circle
pp. 256–268, doi:10.1007/3-540-59071-4_53, ISBN 978-3-540-59071-2. Shmoys, David B. (1997), "Cut problems and their application to divide-and-conquer"
Circular_layout
doi:10.1016/j.disopt.2011.10.001. ISSN 1572-5286. Hochbaum, Dorit S.; Shmoys, David B. (1987-01-01). "Using dual approximation algorithms for scheduling
Balanced_number_partitioning
Sequence of points far from previous points
285–288, doi:10.1016/0167-6377(85)90002-1, MR 0797340 Hochbaum, Dorit S.; Shmoys, David B. (1985), "A best possible heuristic for the k-center problem", Mathematics
Farthest-first_traversal
Variant of the traveling salesman problem
(6): 269–272, doi:10.1016/0167-6377(84)90077-4. Hochbaum, Dorit S.; Shmoys, David B. (May 1986), "A unified approach to approximation algorithms for bottleneck
Bottleneck traveling salesman problem
Bottleneck_traveling_salesman_problem
American mathematician (1924–2021)
P. (1985) History. Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., & Shmoys D. B., eds. In The Traveling Salesman Problem. John Wiley & Sons: New York
Alan_J._Hoffman
Sabnani Ravi Sandhu Hans-Jörg Schek Richard D. Schlichting Kang G. Shin David B. Shmoys Alan J. Smith Ralf Steinmetz Jonathan Turner Marilyn C. Wolf Ouri Wolfson
List of fellows of the Association for Computing Machinery
List_of_fellows_of_the_Association_for_Computing_Machinery
Fair item allocation problem
18. doi:10.1145/1120680.1120683. S2CID 1176760. Lenstra, Jan Karel; Shmoys, David B.; Tardos, Éva (1990-01-01). "Approximation algorithms for scheduling
Egalitarian_item_allocation
DAVID SHMOYS
DAVID SHMOYS
DAVID SHMOYS
DAVID SHMOYS
DAVID SHMOYS
DAVID SHMOYS
DAVID SHMOYS
DAVID SHMOYS
DAVID SHMOYS