default search action
1st RANDOM 1997: Bolognna, Italy
- José D. P. Rolim:
Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings. Lecture Notes in Computer Science 1269, Springer 1997, ISBN 3-540-63248-4
Invited Talk
- Marek Karpinski:
Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. 1-14
Approximation
- Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe:
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. 15-26 - Christos Levcopoulos, Joachim Gudmundsson:
Approximation Algorithms for Covering Polygons with Squares and Similar Problems. 27-41 - Bernd Kreuter, Till Nierhoff:
Greedily Approximating the r-independent Set and k-center Problems on Random Instances. 43-53
Invited Talk
- Sanjeev Arora:
Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. 55
Randomness
- Prasad Tetali, Santosh S. Vempala:
Random Sampling of Euler Tours. 57-66 - Oded Goldreich, Shmuel Safra:
A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. 67-84 - Steven Rudich:
Super-bits, Demi-bits, and NP/qpoly-natural Proofs. 85-93 - Michael E. Saks, Shiyu Zhou:
Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols. 95-109
Invited Talk
- Pierluigi Crescenzi, Viggo Kann:
Approximation on the Web: A Compendium of NP Optimization Problems. 111-118
Algorithms
- Andreas S. Schulz, Martin Skutella:
Random-Based Scheduling: New Approximations and LP Lower Bounds. 119-133 - Marcus Peinado, Thomas Lengauer:
'Go with the winners' Generators with Applications to Molecular Modeling. 135-149 - Dawei Hong, Jean-Camille Birget:
Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines. 151-164
Invited Talk
- Russell Impagliazzo:
Using Hard Problems to Derandomize Algorithms: An Incomplete Survey. 165-173
Complexity
- Andris Ambainis, Rusins Freivalds, Marek Karpinski:
Weak and Strong Recognition by 2-way Randomized Automata. 175-185 - Janis Kaneps, Dainis Geidmanis, Rusins Freivalds:
Tally Languages Accepted by Monte Carlo Pushdown Automata. 187-195 - Steven M. Kautz:
Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures. 197-211 - Yongge Wang:
Randomness, Stochasticity and Approximations. 213-225
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.