Statements (70)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Computer_Scientist
|
| gptkbp:academic_advisor |
gptkb:Robert_Tarjan
|
| gptkbp:affiliation |
gptkb:Cornell_University
|
| gptkbp:award |
Fellow of the ACM
Fellow of the IEEE |
| gptkbp:birth_year |
gptkb:1955
|
| gptkbp:field |
Computer Science
|
| https://www.w3.org/2000/01/rdf-schema#label |
David P. Williamson
|
| gptkbp:influenced_by |
gptkb:John_Hopcroft
gptkb:Michael_Garey gptkb:Christos_Papadimitriou |
| gptkbp:known_for |
Approximation Algorithms
|
| gptkbp:nationality |
gptkb:American
|
| gptkbp:notable_work |
gptkb:Algorithmic_Game_Theory
The Design of Approximation Algorithms |
| gptkbp:publication |
Algorithmic Game Theory and Mechanism Design
The Price of Anarchy in Network Design Approximation Algorithms for Network Design Problems Approximation Algorithms for Scheduling Problems Approximation Schemes for NP-hard Problems Approximation Algorithms for Facility Location Problems Approximation Algorithms for the Minimum Steiner Tree Problem Approximation Algorithms for the Minimum Spanning Tree Problem Approximation Algorithms for the Vertex Cover Problem Approximation Algorithms for the Knapsack Problem Approximation Algorithms for the Set Cover Problem Approximation Algorithms for the Steiner Tree Problem The Price of Anarchy in Network Design with Budget Constraints The Price of Anarchy in Network Design with Uncertain Demand The Price of Anarchy in Network Design with Uncertain Resources Approximation Algorithms for the Minimum Cost Perfect Matching Problem The Price of Anarchy in Network Design with Uncertain Variables Approximation Algorithms for the Maximum Coverage Problem Approximation Algorithms for the Minimum Cost Flow Problem with Uncertain Objectives The Price of Anarchy in Network Design with Uncertain Objectives Approximation Algorithms for the Traveling Salesman Problem Approximation Algorithms for the Feedback Vertex Set Problem The Price of Anarchy in Network Design with Resource Constraints Game Theory and the Price of Anarchy The Design of Approximation Algorithms The Price of Anarchy in Auction Theory The Price of Anarchy in Game Theory The Price of Anarchy in Mechanism Design The Price of Anarchy in Network Design Problems The Price of Anarchy in Network Routing The Price of Anarchy in Social Choice The Price of Stability in Network Design The Price of Anarchy in Network Design with Uncertain Parameters Approximation Algorithms for the Traveling Salesman Problem with Time Windows The Price of Anarchy in Network Design with Nonlinear Costs Approximation Algorithms for the Maximum Independent Set Problem The Price of Anarchy in Network Design with Uncertain Resources and Costs The Price of Anarchy in Network Design with Uncertain Costs The Price of Anarchy in Network Design with Uncertain Constraints and Variables The Price of Anarchy in Network Design with Uncertain Constraints The Complexity of Approximating the Maximum Cut Problem The Price of Anarchy in Network Design with Uncertainty The Price of Anarchy in Network Design with Multiple Objectives Approximation Algorithms for the Minimum Cost Network Design Problem Approximation Algorithms for the Minimum Cost Network Flow Problem Approximation Algorithms for the Minimum Cost Flow Problem with Uncertain Demand Approximation Algorithms for the Minimum Cost Flow Problem Approximation Algorithms for the Minimum Cost Flow Problem with Uncertain Costs Approximation Algorithms for the Minimum Bottleneck Spanning Tree Problem |
| gptkbp:research_interest |
gptkb:strategy
Optimization Algorithm Design |
| gptkbp:bfsParent |
gptkb:Ruth_Tarjan
gptkb:John_H._Hopcroft |
| gptkbp:bfsLayer |
5
|