Abstract is missing.
- Designing Networks with Existing Traffic to Support Fast RestorationMansoor Alicherry, Randeep Bhatia, Yung-Chun (Justin) Wan. 1-12 [doi]
- Simultaneous Source LocationKonstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson. 13-26 [doi]
- Computationally-Feasible Truthful Auctions for Convex BundlesMoshe Babaioff, Liad Blumrosen. 27-38 [doi]
- Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene NetworksPiotr Berman, Bhaskar DasGupta, Eduardo D. Sontag. 39-50 [doi]
- On the Crossing Spanning Tree ProblemVittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh. 51-60 [doi]
- A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and OneMarkus Bläser. 61-71 [doi]
- Maximum Coverage Problem with Group Budget Constraints and ApplicationsChandra Chekuri, Amit Kumar. 72-83 [doi]
- The Greedy Algorithm for the Minimum Common String Partition ProblemMarek Chrobak, Petr Kolman, Jiri Sgall. 84-95 [doi]
- Approximating Additive Distortion of Embeddings into Line MetricsKedar Dhamdhere. 96-104 [doi]
- Polylogarithmic Inapproximability of the Radio Broadcast ProblemMichael Elkin, Guy Kortsarz. 105-116 [doi]
- On Systems of Linear Equations with Two Variables per EquationUriel Feige, Daniel Reichman. 117-127 [doi]
- An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability CaseRahul Garg, Sanjiv Kapoor, Vijay V. Vazirani. 128-138 [doi]
- Cost-Sharing Mechanisms for Network DesignAnupam Gupta, Aravind Srinivasan, Éva Tardos. 139-150 [doi]
- Approximating Max kCSP Using Random RestrictionsGustav Hast. 151-162 [doi]
- Approximation Schemes for Broadcasting in Heterogenous NetworksSamir Khuller, Yoo Ah Kim, Gerhard J. Woeginger. 163-170 [doi]
- Centralized Deterministic Broadcasting in Undirected Multi-hop Radio NetworksDariusz R. Kowalski, Andrzej Pelc. 171-182 [doi]
- Convergence Issues in Competitive GamesVahab S. Mirrokni, Adrian Vetta. 183-194 [doi]
- Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering ProblemAlantha Newman. 195-206 [doi]
- Min-Max Multiway CutZoya Svitkina, Éva Tardos. 207-218 [doi]
- The Chromatic Number of Random Regular GraphsDimitris Achlioptas, Cristopher Moore. 219-228 [doi]
- Estimating the Distance to a Monotone FunctionNir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu. 229-236 [doi]
- Edge Coloring with DelaysNoga Alon, Vera Asodi. 237-248 [doi]
- Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum EncryptionAndris Ambainis, Adam Smith. 249-260 [doi]
- The Sketching Complexity of Pattern MatchingZiv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar. 261-272 [doi]
- Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutionsMichael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld. 273-285 [doi]
- Robust Locally Testable Codes and Products of CodesEli Ben-Sasson, Madhu Sudan. 286-297 [doi]
- A Stateful Implementation of a Random Function Supporting Parity Queries over HypercubesAndrej Bogdanov, Hoeteck Wee. 298-309 [doi]
- Strong Refutation Heuristics for Random k-SATAmin Coja-Oghlan, Andreas Goerdt, André Lanka. 310-321 [doi]
- Counting Connected Graphs and Hypergraphs via the Probabilistic MethodAmin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. 322-333 [doi]
- Improved Randomness Extraction from Two Independent SourcesYevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz. 334-344 [doi]
- The Diameter of Randomly Perturbed Digraphs and Some Applications.Abraham Flaxman, Alan M. Frieze. 345-356 [doi]
- Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence MethodDavid Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz. 357-368 [doi]
- Estimating Frequency Moments of Data Streams Using Random Linear CombinationsSumit Ganguly. 369-380 [doi]
- Fooling Parity Tests with Parity GatesDan Gutfreund, Emanuele Viola. 381-392 [doi]
- Distribution-Free Connectivity TestingShirley Halevy, Eyal Kushilevitz. 393-404 [doi]
- Testing the Independence Number of HypergraphsMichael Langberg. 405-416 [doi]
- A Note on Approximate Counting for k-DNFLuca Trevisan. 417-426 [doi]