Conferences in DBLP
Mansoor Alicherry , Randeep Bhatia , Yung-Chun (Justin) Wan Designing Networks with Existing Traffic to Support Fast Restoration. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:1-12 [Conf ] Konstantin Andreev , Charles Garrod , Bruce M. Maggs , Adam Meyerson Simultaneous Source Location. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:13-26 [Conf ] Moshe Babaioff , Liad Blumrosen Computationally-Feasible Truthful Auctions for Convex Bundles. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:27-38 [Conf ] Piotr Berman , Bhaskar DasGupta , Eduardo D. Sontag Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:39-50 [Conf ] Vittorio Bilò , Vineet Goyal , R. Ravi , Mohit Singh On the Crossing Spanning Tree Problem. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:51-60 [Conf ] Markus Bläser A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:61-71 [Conf ] Chandra Chekuri , Amit Kumar Maximum Coverage Problem with Group Budget Constraints and Applications. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:72-83 [Conf ] Marek Chrobak , Petr Kolman , Jiri Sgall The Greedy Algorithm for the Minimum Common String Partition Problem. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:84-95 [Conf ] Kedar Dhamdhere Approximating Additive Distortion of Embeddings into Line Metrics. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:96-104 [Conf ] Michael Elkin , Guy Kortsarz Polylogarithmic Inapproximability of the Radio Broadcast Problem. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:105-116 [Conf ] Uriel Feige , Daniel Reichman On Systems of Linear Equations with Two Variables per Equation. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:117-127 [Conf ] Rahul Garg , Sanjiv Kapoor , Vijay V. Vazirani An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:128-138 [Conf ] Anupam Gupta , Aravind Srinivasan , Éva Tardos Cost-Sharing Mechanisms for Network Design. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:139-150 [Conf ] Gustav Hast Approximating Max kCSP Using Random Restrictions. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:151-162 [Conf ] Samir Khuller , Yoo Ah Kim , Gerhard J. Woeginger Approximation Schemes for Broadcasting in Heterogenous Networks. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:163-170 [Conf ] Dariusz R. Kowalski , Andrzej Pelc Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:171-182 [Conf ] Vahab S. Mirrokni , Adrian Vetta Convergence Issues in Competitive Games. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:183-194 [Conf ] Alantha Newman Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:195-206 [Conf ] Zoya Svitkina , Éva Tardos Min-Max Multiway Cut. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:207-218 [Conf ] Dimitris Achlioptas , Cristopher Moore The Chromatic Number of Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:219-228 [Conf ] Nir Ailon , Bernard Chazelle , Seshadhri Comandur , Ding Liu Estimating the Distance to a Monotone Function. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:229-236 [Conf ] Noga Alon , Vera Asodi Edge Coloring with Delays. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:237-248 [Conf ] Andris Ambainis , Adam Smith Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:249-260 [Conf ] Ziv Bar-Yossef , T. S. Jayram , Robert Krauthgamer , Ravi Kumar The Sketching Complexity of Pattern Matching. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:261-272 [Conf ] Michael Ben-Or , Don Coppersmith , Michael Luby , Ronitt Rubinfeld Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:273-285 [Conf ] Eli Ben-Sasson , Madhu Sudan Robust Locally Testable Codes and Products of Codes. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:286-297 [Conf ] Andrej Bogdanov , Hoeteck Wee A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:298-309 [Conf ] Amin Coja-Oghlan , Andreas Goerdt , André Lanka Strong Refutation Heuristics for Random k-SAT. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:310-321 [Conf ] Amin Coja-Oghlan , Cristopher Moore , Vishal Sanwalani Counting Connected Graphs and Hypergraphs via the Probabilistic Method. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:322-333 [Conf ] Yevgeniy Dodis , Ariel Elbaz , Roberto Oliveira , Ran Raz Improved Randomness Extraction from Two Independent Sources. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:334-344 [Conf ] Abraham Flaxman , Alan M. Frieze The Diameter of Randomly Perturbed Digraphs and Some Applications.. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:345-356 [Conf ] David Gamarnik , Tomasz Nowicki , Grzegorz Swirszcz Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:357-368 [Conf ] Sumit Ganguly Estimating Frequency Moments of Data Streams Using Random Linear Combinations. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:369-380 [Conf ] Dan Gutfreund , Emanuele Viola Fooling Parity Tests with Parity Gates. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:381-392 [Conf ] Shirley Halevy , Eyal Kushilevitz Distribution-Free Connectivity Testing. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:393-404 [Conf ] Michael Langberg Testing the Independence Number of Hypergraphs. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:405-416 [Conf ] Luca Trevisan A Note on Approximate Counting for k-DNF. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:417-426 [Conf ]