- On Generalizations of Network Design Problems with Degree Bounds
- Quasi-Polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost
- Sharing the cost more efficiently: Improved Approximation for Multicommodity Rent-or-Buy
- Truthful and NearOptimal Mechanism Design via Linear Programming #
- PrimalDual Algorithms for Connected Facility Location Problems
- FaultTolerant Facility Location: a randomized dependent LProunding algorithm #
- APPROXIMATION ALGORITHMS FOR CLUSTERING A Dissertation
- Truthful and NearOptimal Mechanism Design via Linear Programming ronlavi@ist.caltech.edu
- Approximation Algorithms for Data Placement Problems # Ivan Baev + Rajmohan Rajaraman # Chaitanya Swamy
- The Effectiveness of Stackelberg Strategies and Tolls for Network Congestion Games #
- Approximation algorithms for 2stage stochastic optimization problems
- Approximation Algorithms for Singleminded Envyfree Profitmaximization Problems with Limited Supply
- Approximation algorithms for prize collecting forest problems with submodular penalty functions
- Approximation algorithms for network problems
- LPbased Approximation Algorithms for Capacitated Facility Retsef Levi + David B. Shmoys # Chaitanya Swamy
- Optimal PowerDown Strategies John Augustine #
- Correlation Clustering: Maximizing Agreements via Semidefinite Programming
- Sharing the cost more efficiently: Improved Approximation for Multicommodity Rent-or-Buy
- Truthful Mechanism Design for MultiDimensional Scheduling via Cycle Monotonicity #
- Stochastic Optimization is (almost) as Easy as Deterministic Optimization # David B. Shmoys +
- FaultTolerant Facility Location # Chaitanya Swamy + David B. Shmoys #
- Samplingbased Approximation Algorithms for Multistage Stochastic Optimization #
- FaultTolerant Facility Location: a randomized dependent LProunding algorithm #
- Improved approximations for tour and tree Jochen Konemann 1? , Goran Konjevod 2?? ,
- Approximation algorithms for network problems
- The Effectiveness of Lloydtype Methods for the kMeans Problem Rafail Ostrovsky # Yuval Rabani + Leonard J. Schulman # Chaitanya Swamy
- Approximation Algorithms for Labeling Hierarchical Taxonomies Yuval Rabani # Leonard J. Schulman + Chaitanya Swamy #
- The E#ectiveness of Stackelberg Strategies and Tolls for Network Congestion Games
- The Effectiveness of LloydType Methods for the kMeans Problem Rafail Ostrovsky #
- The Sample Average Approximation Method for 2stage Stochastic Optimization
- An Approximation Scheme for Stochastic Linear Programming and its Application to Stochastic Integer Programs #
- Algorithms for ProbabilisticallyConstrained Models of RiskAverse Stochastic Optimization with BlackBox Distributions
- Facility Location with Client Latencies: LinearProgramming based Techniques for MinimumLatency Problems
- Truthful Mechanism Design for MultiDimensional Scheduling via Cycle Monotonicity
- A Combinatorial Algorithm for Computing a Maximum Independent Set in a tperfect Graph
- Approximation Algorithms for Graph Homomorphism Problems
- Covering Graphs using Trees and Stars ? G. Even 1 , N. Garg 2 , J. Konemann 3 , R. Ravi 3 , and A. Sinha 3
- A Penalty Method for American Options with Jump Diffusion Y. d'Halluin
- Hypergraphic LP Relaxations for Steiner Trees Deeparnab Chakrabarty, Jochen Konemann, and David Pritchard
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
- Uncrossing Partitions Jochen Konemann and David Pritchard
- A Group-Strategyproof Mechanism for Steiner Forests Jochen Konemann
- Primaldual meets local search: Approximating MST's with nonuniform degree bounds #
- Cut Problems in Graphs with a Budget Roee Engelberg1
- Approximation algorithms for edge-dilation k-center Jochen Konemann 1 , Yanjun Li, Ojas Parekh, and Amitabh Sinha
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- On the Integrality Ratio for Tree Augmentation J. Cheriyan
- FACULTY OF MATHEMATICS REPORT REPORT >> FACULTY OF MATHEMATICS
- Date: 2010-02-01List of New Items since: 2010-01-01
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- Fast Combinatorial Algorithms for Packing and Covering Problems
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
- Department of Statistics & Actuarial Science Graduate Degree Requirements
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems
- The Effectiveness of Lloyd-Type Methods for the k-Means Problem Rafail Ostrovsky
- The Effectiveness of Lloyd-type Methods for the k-Means Problem Rafail Ostrovsky
- Truthful Mechanism Design for Multi-Dimensional Scheduling via Cycle Monotonicity
- Approximation Algorithms for Labeling Hierarchical Taxonomies Yuval Rabani
- his was the slogan proudly displayed on bags carried by the participants in
- he new Scotiabank Software Engineering Labs were officially opened
- Former Dean, Alan George, who taught Cheriton in the 1970s, was gratified that such
- Posted with permission from SIAM Journal on Computing, 24:296-317, 1995. Copyright 1995 by the Society for Industrial and Applied Mathematics. All rights reserved.
- To appear in: Approximation Algorithms, D. Hochbaum, ed. C H A P T E R
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- A Unified Approach to Approximating Partial Covering Problems Jochen Konemann
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions
- From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- Math. Program., Ser. A (2011) 127:345370 DOI 10.1007/s10107-009-0289-2
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- CO453: Network Design Winter 2007 Instructor: Chaitanya Swamy
- University of Waterloo ADMISSIONSI
- Edition 2010.2 Spring 2010 The Advisor
- complete assigned work without sufficient long-term understanding.
- hat impact would it have on your company if you were expected to
- This fall sees the unveiling of a new look for the Faculty of Mathematics web site.
- 07Faculty of MATHEMATICS 2007 Report Faculty of MATHEMATICS
- A N N U A L R E P O R T University of Waterloo | Faculty of Mathematics
- Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply
- Truthful Mechanism Design for Multi-Dimensional Scheduling via Cycle Monotonicity
- The Effectiveness of Stackelberg Strategies and Tolls for Network Congestion Games
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
- Optimal Power-Down Strategies John Augustine
- Fault-Tolerant Facility Location Chaitanya Swamy
- APPROXIMATION ALGORITHMS FOR CLUSTERING A Dissertation
- STATISTICS 230 COURSE NOTES Chris Springer, revised by Jerry Lawless and Don McLeish
- The Sample Average Approximation Method for 2-stage Stochastic Optimization
- CS 473 / CM 473 / CS 673 Medical Image Processing Course Information
- Primal-dual meets local search: Approximating MST's with nonuniform degree bounds
- Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems
- CURRICULUM VITAE PERSONAL DATA
- 05FACULTY OF MATHEMATICS UNIVERSITY OF WATERLOO
- Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
- Primal-Dual Based Distributed Algorithms for Vertex Cover with Semi-Hard Capacities
- An Approximation Scheme for Stochastic Linear Programming and its Application to Stochastic Integer Programs
- Optimal Power-Down Strategies John Augustine
- TOWARDS A MATROID-MINOR STRUCTURE THEORY JIM GEELEN, BERT GERARDS, AND GEOFF WHITTLE
- Stochastic Optimization is (almost) as Easy as Deterministic Optimization David B. Shmoys
- Operations Research Contest 2008 Introduction
- Approximation algorithms for prize collecting forest problems with submodular penalty functions
- Combinatorics of Electrical Networks
- On Generalizations of Network Design Problems with Degree Bounds
- On Column-restricted and Priority Covering Integer Programs
- A Unified Approach to Approximating Partial Covering Problems
- Simple Cost Sharing Schemes for Multicommodity Rent-or-Buy and Stochastic Steiner Tree
- Approximation Algorithms For Minimum-Cost Low-Degree Subgraphs
- Algorithms Column: Approximation Algorithms for 2-Stage Stochastic Optimization Problems
- May 2005 for Stage 2 of the CCC with the top 22 Canadian students from
- A Matter of Degree: Improved Approximation Algorithms for DegreeBounded Minimum Spanning Trees
- Distributed Weighted Vertex Cover via Maximal Fabrizio Grandoni1, Jochen Konemann2, and Alessandro Panconesi1
- PUBLICATIONS [(a)] Refereed Publications.
- Faculty of Mathematics Alumni Newsletter
- LP-based Approximation Algorithms for Capacitated Facility Retsef Levi
- The Effectiveness of Stackelberg Strategies and Tolls for Network Congestion Games
- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
- Your Teaching Assistantship (TA) Most of you will be working as a Teaching Assistant (TA) for one undergraduate class in
- How Efficient are Delaunay Refined Meshes? An Empirical Study
- The School Bus Problem on Trees Adrian Bock1