Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications

TOTAL DOCUMENTS

141

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611972108, 9781611973099

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Online Scheduling with General Cost Functions

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.99 ◽

2012 ◽

Cited By ~ 7

Author(s):

Sungjin Im ◽

Benjamin Moseley ◽

Kirk Pruhs

Keyword(s):

Online Scheduling ◽

Cost Functions ◽

General Cost Functions

Download Full-text

A Matroid Approach to Stable Matchings with Lower Quotas

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.12 ◽

2012 ◽

Cited By ~ 11

Author(s):

Tamás Fleiner ◽

Naoyuki Kamiyama

Keyword(s):

Stable Matchings ◽

Lower Quotas

Download Full-text

Approximation Algorithms for Stochastic Orienteering

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.121 ◽

2012 ◽

Cited By ~ 19

Author(s):

Anupam Gupta ◽

Ravishankar Krishnaswamy ◽

Viswanath Nagarajan ◽

R. Ravi

Keyword(s):

Approximation Algorithms

Download Full-text

Inapproximability of the Multi-level Uncapacitated Facility Location Problem

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.59 ◽

2012 ◽

Cited By ~ 10

Author(s):

Ravishankar Krishnaswamy ◽

Maxim Sviridenko

Keyword(s):

Facility Location ◽

Location Problem ◽

Facility Location Problem ◽

Uncapacitated Facility Location Problem ◽

Multi Level

Download Full-text

Simple and Practical Algorithm for Sparse Fourier Transform

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.93 ◽

2012 ◽

Cited By ~ 135

Author(s):

Haitham Hassanieh ◽

Piotr Indyk ◽

Dina Katabi ◽

Eric Price

Keyword(s):

Fourier Transform ◽

Practical Algorithm

Download Full-text

Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.47 ◽

2012 ◽

Cited By ~ 28

Author(s):

John Augustine ◽

Gopal Pandurangan ◽

Peter Robinson ◽

Eli Upfal

Keyword(s):

Peer To Peer ◽

Peer Networks ◽

Efficient Computation ◽

Peer To Peer Networks

Download Full-text

Approximation Algorithms and Hardness of the k-Route Cut Problem

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.63 ◽

2012 ◽

Cited By ~ 4

Author(s):

Julia Chuzhoy ◽

Yury Makarychev ◽

Aravindan Vijayaraghavan ◽

Yuan Zhou

Keyword(s):

Approximation Algorithms

Download Full-text

Black-Box Reductions for Cost-Sharing Mechanism Design

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.72 ◽

2012 ◽

Cited By ~ 2

Author(s):

Konstantinos Georgiou ◽

Chaitanya Swamy

Keyword(s):

Mechanism Design ◽

Cost Sharing ◽

Black Box

Download Full-text

An O(n2) Time Algorithm for Alternating Büchi Games

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.109 ◽

2012 ◽

Cited By ~ 20

Author(s):

Krishnendu Chatterjee ◽

Monika Henzinger

Keyword(s):

Time Algorithm

Download Full-text

The Entropy Rounding Method in Approximation Algorithms

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.32 ◽

2012 ◽

Cited By ~ 7

Author(s):

Thomas Rothvoß

Keyword(s):

Approximation Algorithms

Download Full-text

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Online Scheduling with General Cost Functions

A Matroid Approach to Stable Matchings with Lower Quotas

Approximation Algorithms for Stochastic Orienteering

Inapproximability of the Multi-level Uncapacitated Facility Location Problem

Simple and Practical Algorithm for Sparse Fourier Transform

Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks

Approximation Algorithms and Hardness of the k-Route Cut Problem

Black-Box Reductions for Cost-Sharing Mechanism Design

An O(n2) Time Algorithm for Alternating Büchi Games

The Entropy Rounding Method in Approximation Algorithms

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications