000			04876nam a22006735i 4500
001			978-3-540-48413-4
003			DE-He213
005			20240423132508.0
007			cr nn 008mamaa
008			121227s1999 gw | s |||| 0|eng d
020			_a9783540484134 _9978-3-540-48413-4
024	7		_a10.1007/b72324 _2doi
050		4	_aQA76.6-76.66
072		7	_aUM _2bicssc
072		7	_aCOM051000 _2bisacsh
072		7	_aUM _2thema
082	0	4	_a005.11 _223
245	1	0	_aRandomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques _h[electronic resource] : _bThird 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 / _cedited by Dorit Hochbaum, Klaus Jansen, Jose D.P. Rolim, Alistair Sinclair.
250			_a1st ed. 1999.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999.
300			_aX, 298 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x1611-3349 ; _v1671
505	0		_aSession 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 -- 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 -- 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.
650		0	_aComputer programming.
650		0	_aProbabilities.
650		0	_aData structures (Computer science).
650		0	_aInformation theory.
650		0	_aAlgorithms.
650		0	_aComputer science _xMathematics.
650		0	_aDiscrete mathematics.
650		0	_aArtificial intelligence _xData processing.
650	1	4	_aProgramming Techniques.
650	2	4	_aProbability Theory.
650	2	4	_aData Structures and Information Theory.
650	2	4	_aAlgorithms.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aData Science.
700	1		_aHochbaum, Dorit. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aJansen, Klaus. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aRolim, Jose D.P. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aSinclair, Alistair. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783540663294
776	0	8	_iPrinted edition: _z9783662168080
830		0	_aLecture Notes in Computer Science, _x1611-3349 ; _v1671
856	4	0	_uhttps://doi.org/10.1007/b72324
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
912			_aZDB-2-BAE
942			_cSPRINGER
999			_c188378 _d188378