default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th RANDOM / 7th APPROX 2004: Cambridge, MA, USA
- Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron:
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings. Lecture Notes in Computer Science 3122, Springer 2004, ISBN 3-540-22894-2
Contributed Talks of APPROX
- Mansoor Alicherry, Randeep Bhatia, Yung-Chun (Justin) Wan:
Designing Networks with Existing Traffic to Support Fast Restoration. 1-12 - Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson:
Simultaneous Source Location. 13-26 - Moshe Babaioff, Liad Blumrosen:
Computationally-Feasible Truthful Auctions for Convex Bundles. 27-38 - Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. 39-50 - Vittorio Bilò
, Vineet Goyal, R. Ravi, Mohit Singh:
On the Crossing Spanning Tree Problem. 51-60 - Markus Bläser:
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One. 61-71 - Chandra Chekuri, Amit Kumar:
Maximum Coverage Problem with Group Budget Constraints and Applications. 72-83 - Marek Chrobak, Petr Kolman, Jirí Sgall:
The Greedy Algorithm for the Minimum Common String Partition Problem. 84-95 - Kedar Dhamdhere:
Approximating Additive Distortion of Embeddings into Line Metrics. 96-104 - Michael Elkin, Guy Kortsarz:
Polylogarithmic Inapproximability of the Radio Broadcast Problem. 105-116 - Uriel Feige, Daniel Reichman:
On Systems of Linear Equations with Two Variables per Equation. 117-127 - Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. 128-138 - Anupam Gupta, Aravind Srinivasan, Éva Tardos:
Cost-Sharing Mechanisms for Network Design. 139-150 - Gustav Hast:
Approximating Max kCSP Using Random Restrictions. 151-162 - Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger:
Approximation Schemes for Broadcasting in Heterogenous Networks. 163-170 - Dariusz R. Kowalski, Andrzej Pelc:
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. 171-182 - Vahab S. Mirrokni, Adrian Vetta:
Convergence Issues in Competitive Games. 183-194 - Alantha Newman:
Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem. 195-206 - Zoya Svitkina, Éva Tardos:
Min-Max Multiway Cut. 207-218
Contributed Talks of RANDOM
- Dimitris Achlioptas, Cristopher Moore:
The Chromatic Number of Random Regular Graphs. 219-228 - Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the Distance to a Monotone Function. 229-236 - Noga Alon, Vera Asodi:
Edge Coloring with Delays. 237-248 - Andris Ambainis, Adam D. Smith:
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. 249-260 - Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar:
The Sketching Complexity of Pattern Matching. 261-272 - Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. 273-285 - Eli Ben-Sasson, Madhu Sudan:
Robust Locally Testable Codes and Products of Codes. 286-297 - Andrej Bogdanov, Hoeteck Wee:
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. 298-309 - Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Strong Refutation Heuristics for Random k-SAT. 310-321 - Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
Counting Connected Graphs and Hypergraphs via the Probabilistic Method. 322-333 - Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz:
Improved Randomness Extraction from Two Independent Sources. 334-344 - Abraham Flaxman, Alan M. Frieze:
The Diameter of Randomly Perturbed Digraphs and Some Applications.. 345-356 - David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz:
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method. 357-368 - Sumit Ganguly:
Estimating Frequency Moments of Data Streams Using Random Linear Combinations. 369-380 - Dan Gutfreund, Emanuele Viola:
Fooling Parity Tests with Parity Gates. 381-392 - Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Connectivity Testing. 393-404 - Michael Langberg:
Testing the Independence Number of Hypergraphs. 405-416 - Luca Trevisan:
A Note on Approximate Counting for k-DNF. 417-426
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-26 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
