|
|
|
|
| LEADER |
03929nmm a2200457 u 4500 |
| 001 |
EB000658573 |
| 003 |
EBX01000000000000000511655 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540484134
|
| 100 |
1 |
|
|a Hochbaum, Dorit
|e [editor]
|
| 245 |
0 |
0 |
|a Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
|h Elektronische Ressource
|b Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,Berkeley, CA, USA, August 8-11, 1999 Pro
|c edited by Dorit Hochbaum, Klaus Jansen, Jose D.P. Rolim, Alistair Sinclair
|
| 250 |
|
|
|a 1st ed. 1999
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1999, 1999
|
| 300 |
|
|
|a X, 298 p
|b online resource
|
| 505 |
0 |
|
|a Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions -- Minisymposium on Scheduling Talks -- Scheduling with Unexpected Machine Breakdowns -- Scheduling on a Constant Number of Machines
|
| 505 |
0 |
|
|a Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets -- Session Approx 3 -- Stochastic Machine Scheduling: Performance Guarantees for LP-Based Priority Policies -- Efficient Redundant Assignments under Fault-Tolerance Constraints -- Scheduling with Machine Cost -- A Linear Time Approximation Scheme for the Job Shop Scheduling Problem -- Invited Talk -- Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example -- Session Approx 4 -- Hardness Results for the Power Range Assignment Problem in Packet Radio Networks -- A New Approximation Algorithm for the Demand Routing and Slotting Problem with Unit Demands on Rings -- Session Random 4 -- Algorithms for Graph Partitioning on the Planted Partition Model -- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest -- Fast Approximate PCPs for MultidimensionalBin-Packing Problems --
|
| 505 |
0 |
|
|a Session Random 1 -- Completeness and Robustness Properties of Min-Wise Independent Permutations -- Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families -- Session Approx 1 -- Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths -- Approximating Minimum Manhattan Networks -- Approximation of Multi-Color Discrepancy -- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem -- Session Approx 2 -- Set Cover with Requirements and Costs Evolving over Time -- Multicoloring Planar Graphs and Partial k-Trees -- Session: Random 2 -- Testing the Diameter of Graphs -- Improved Testing Algorithms for Monotonicity -- Linear Consistency Testing -- Improved Bounds for Sampling Contingency Tables -- Invited Talk -- Probabilistic and Deterministic Approximations of the Permanent -- Session Random 3 -- Improved Derandomization of BPP Using a Hitting Set Generator --
|
| 653 |
|
|
|a Artificial intelligence / Data processing
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Data Structures and Information Theory
|
| 653 |
|
|
|a Probability Theory
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data structures (Computer science)
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Probabilities
|
| 653 |
|
|
|a Data Science
|
| 700 |
1 |
|
|a Jansen, Klaus
|e [editor]
|
| 700 |
1 |
|
|a Rolim, Jose D.P.
|e [editor]
|
| 700 |
1 |
|
|a Sinclair, Alistair
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b72324
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b72324?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.11
|