Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Williamson, Jonathan P.
95  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Contributors:

, In: Microbial Forensics,
Allard, M.W. ; Allen, Jonathan ; Amara, Philip S.... - p. xi-xiii , 2020
Link: https://doi.org/10.1016/..
 
?
2

List of contributors:

, In: Translational Sports Medicine,
Abboud, Joseph ; Akhnoukh, Kyrillos M. ; Alexandrov, Alexander... - p. xiii-xix , 2023
Link: https://doi.org/10.1016/..
 
?
3

Contributors:

, In: Prostate Cancer,
Abbou, Clément-Claude ; Abrahams, Neil A. ; Akduman, Bulent... - p. xiii-xxi , 2003
Link: https://doi.org/10.1016/..
 
?
4

A Lower Bound for the Max Entropy Algorithm for TSP:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Jin, Billy ; Klein, Nathan ; Williamson, David P. - p. 238-251 , 2024
Link: https://doi.org/10.1007/..
 
?
5

GILP: An Interactive Tool for Visualizing the Simplex Algor..:

, In: Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1,
Robbins, Henry W. ; Gutekunst, Samuel C. ; Shmoys, David B.. - p. 108-114 , 2023
Link: https://dl.acm.org/doi/1..
 
?
6

A 4/3-Approximation Algorithm for Half-Integral Cycle Cut I..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Jin, Billy ; Klein, Nathan ; Williamson, David P. - p. 217-230 , 2023
Link: https://doi.org/10.1007/..
 
?
7

The Two-Stripe Symmetric Circulant TSP is in P:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Gutekunst, Samuel C. ; Jin, Billy ; Williamson, David P. - p. 319-332 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Improved Analysis of RANKING for Online Vertex-Weighted Bip..:

, In: Web and Internet Economics; Lecture Notes in Computer Science,
Jin, Billy ; Williamson, David P. - p. 207-225 , 2022
Link: https://doi.org/10.1007/..
 
?
9

A proof of the Boyd-Carr conjecture:

, In: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms,
Schalekamp, Frans ; Williamson, David P. ; van Zuylen, Anke - p. 1477-1486 , 2012
Link: https://dl.acm.org/doi/1..
 
?
10

Approximation algorithms for prize collecting forest proble..:

, In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms,
Sharma, Yogeshwer ; Swamy, Chaitanya ; Williamson, David P. - p. 1275-1284 , 2007
Link: https://dl.acm.org/doi/1..
 
?
11

Stackelberg thresholds in network routing games or the valu..:

, In: Proceedings of the 8th ACM conference on Electronic commerce,
Sharma, Yogeshwer ; Williamson, David P. - p. 93-102 , 2007
Link: https://dl.acm.org/doi/1..
 
?
12

Deterministic pivoting algorithms for constrained ranking a..:

, In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms,
van Zuylen, Anke ; Hegde, Rajneesh ; Jain, Kamal. - p. 405-414 , 2007
Link: https://dl.acm.org/doi/1..
 
?
13

A simple GAP-canceling algorithm for the generalized maximu..:

, In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm,
Restrepo, Mateo ; Williamson, David P. - p. 534-543 , 2006
Link: https://dl.acm.org/doi/1..
 
?
14

An adaptive algorithm for selecting profitable keywords for..:

, In: Proceedings of the 7th ACM conference on Electronic commerce,
Rusmevichientong, Paat ; Williamson, David P. - p. 260-269 , 2006
Link: https://dl.acm.org/doi/1..
 
?
15

A general approach for incremental approximation and hierar..:

, In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm,
Lin, Guolong ; Nagarajan, Chandrashekhar ; Rajaraman, Rajmohan. - p. 1147-1156 , 2006
Link: https://dl.acm.org/doi/1..
 
1-15