Conferences in DBLP
Andrei Z. Broder , Michael Mitzenmacher Completeness and Robustness Properties of Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:1-10 [Conf ] Michael E. Saks , Aravind Srinivasan , Shiyu Zhou , David Zuckerman Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:11-15 [Conf ] Noga Alon , Uri Arad , Yossi Azar Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:16-27 [Conf ] Joachim Gudmundsson , Christos Levcopoulos , Giri Narasimhan Approximating Minimum Manhattan Networks. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:28-38 [Conf ] Benjamin Doerr , Anand Srivastav Approximation of Multi-color Discrepancy. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:39-50 [Conf ] Hans Kellerer A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:51-62 [Conf ] Milena Mihail Set Cover with Requirements and Costs Evolving over Time. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:63-72 [Conf ] Magnús M. Halldórsson , Guy Kortsarz Multicoloring Planar Graphs and Partial k-Trees. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:73-84 [Conf ] Michal Parnas , Dana Ron Testing the Diameter of Graphs. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:85-96 [Conf ] Yevgeniy Dodis , Oded Goldreich , Eric Lehman , Sofya Raskhodnikova , Dana Ron , Alex Samorodnitsky Improved Testing Algorithms for Monotonicity. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:97-108 [Conf ] Yonatan Aumann , Johan Håstad , Michael O. Rabin , Madhu Sudan Linear Consistency Testing. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:109-120 [Conf ] Ben Morris Improved Bounds for Sampling Contingency Tables. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:121-129 [Conf ] Avi Wigderson Probabilistic and Deterministic Approximations of the Permanent (abstract). [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:130- [Conf ] Oded Goldreich , Avi Wigderson Improved Derandomization of BPP Using a Hitting Set Generator. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:131-137 [Conf ] Andreas Baltz , Tomasz Schoen , Anand Srivastav Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:138-143 [Conf ] Rolf H. Möhring , Andreas S. Schulz , Marc Uetz Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:144-155 [Conf ] Dimitris Fotakis , Paul G. Spirakis Efficient Redundant Assignments under Fault-Tolerance Constraints. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:156-167 [Conf ] Csanád Imreh , John Noga Scheduling with Machine Cost. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:168-176 [Conf ] Klaus Jansen , Roberto Solis-Oba , Maxim Sviridenko A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:177-188 [Conf ] Uriel Feige Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT Example. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:189-196 [Conf ] Andrea E. F. Clementi , Paolo Penna , Riccardo Silvestri Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:197-208 [Conf ] Christine T. Cheng A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:209-220 [Conf ] Anne Condon , Richard M. Karp Algorithms for Graph Partitioning on the Planted Partition Model. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:221-232 [Conf ] Seth Pettie , Vijaya Ramachandran A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:233-244 [Conf ] Tugkan Batu , Ronitt Rubinfeld , Patrick White Fast Approximate PCPs for Multidimensional Bin-Packing Problems. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:245-256 [Conf ] Russell A. Martin , Dana Randall Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:257-268 [Conf ] Susanne Albers , Günter Schmidt Scheduling with Unexpected Machine Breakdowns. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:269-280 [Conf ] Foto N. Afrati , Evripidis Bampis , Claire Kenyon , Ioannis Milis Scheduling on a Constant Number of Machines. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:281-287 [Conf ]