The SCEAS System
Navigation Menu

Conferences in DBLP

Approximation Algorithms for Combinatorial Optimization (APPROX) (approx)
2004 (conf/approx/2004)

  1. 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]
  2. Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson
    Simultaneous Source Location. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:13-26 [Conf]
  3. Moshe Babaioff, Liad Blumrosen
    Computationally-Feasible Truthful Auctions for Convex Bundles. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:27-38 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. Kedar Dhamdhere
    Approximating Additive Distortion of Embeddings into Line Metrics. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:96-104 [Conf]
  10. Michael Elkin, Guy Kortsarz
    Polylogarithmic Inapproximability of the Radio Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:105-116 [Conf]
  11. 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]
  12. 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]
  13. Anupam Gupta, Aravind Srinivasan, Éva Tardos
    Cost-Sharing Mechanisms for Network Design. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:139-150 [Conf]
  14. Gustav Hast
    Approximating Max kCSP Using Random Restrictions. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:151-162 [Conf]
  15. 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]
  16. 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]
  17. Vahab S. Mirrokni, Adrian Vetta
    Convergence Issues in Competitive Games. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:183-194 [Conf]
  18. 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]
  19. Zoya Svitkina, Éva Tardos
    Min-Max Multiway Cut. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:207-218 [Conf]
  20. Dimitris Achlioptas, Cristopher Moore
    The Chromatic Number of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:219-228 [Conf]
  21. 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]
  22. Noga Alon, Vera Asodi
    Edge Coloring with Delays. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:237-248 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. Sumit Ganguly
    Estimating Frequency Moments of Data Streams Using Random Linear Combinations. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:369-380 [Conf]
  34. Dan Gutfreund, Emanuele Viola
    Fooling Parity Tests with Parity Gates. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:381-392 [Conf]
  35. Shirley Halevy, Eyal Kushilevitz
    Distribution-Free Connectivity Testing. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:393-404 [Conf]
  36. Michael Langberg
    Testing the Independence Number of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:405-416 [Conf]
  37. Luca Trevisan
    A Note on Approximate Counting for k-DNF. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:417-426 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002