|
|
|
|
LEADER |
04294nmm a2200397 u 4500 |
001 |
EB000379264 |
003 |
EBX01000000000000000232316 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
130626 ||| eng |
020 |
|
|
|a 9783540742081
|
100 |
1 |
|
|a Charikar, Moses
|e [editor]
|
245 |
0 |
0 |
|a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
|h Elektronische Ressource
|b 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
|c edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim
|
250 |
|
|
|a 1st ed. 2007
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2007, 2007
|
300 |
|
|
|a XII, 628 p
|b online resource
|
505 |
0 |
|
|a The Cover Time of Random Digraphs -- Eigenvectors of Random Graphs: Nodal Domains -- Lower Bounds for Swapping Arthur and Merlin -- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects -- On Estimating Frequency Moments of Data Streams -- Distribution-Free Testing Lower Bounds for Basic Boolean Functions -- On the Randomness Complexity of Property Testing -- On the Benefits of Adaptivity in Property Testing of Dense Graphs -- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours -- Better Binary List-Decodable Codes Via Multilevel Concatenation -- Worst-Case to Average-Case Reductions Revisited -- On Finding Frequent Elements in a Data Stream -- Implementing Huge Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility
|
505 |
0 |
|
|a Contributed Talks of APPROX -- Approximation Algorithms and Hardness for Domination with Propagation -- A Knapsack Secretary Problem with Applications -- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- Improved Approximation Algorithms for the Spanning Star Forest Problem -- Packing and Covering ?-Hyperbolic Spaces by Balls -- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems -- Two Randomized Mechanisms for Combinatorial Auctions -- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs -- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows -- Stochastic Steiner Tree with Non-uniform Inflation -- On the Approximation Resistance of a Random Predicate -- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ?1 Embeddability of Negative Type Metrics --
|
505 |
0 |
|
|a Optimal Resource Augmentations for Online Knapsack -- Soft Edge Coloring -- Approximation Algorithms for the Max-Min Allocation Problem -- Hardness of Embedding Metric Spaces of Equal Size -- Coarse Differentiation and Multi-flows in Planar Graphs -- Maximum Gradient Embeddings and Monotone Clustering -- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems -- Encouraging Cooperation in Sharing Supermodular Costs -- Almost Exact Matchings -- Contributed Talks of RANDOM -- On Approximating the Average Distance Between Points -- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR -- A Sequential Algorithm for Generating Random Graphs -- Local Limit Theorems for the Giant Component of Random Hypergraphs -- Derandomization of Euclidean Random Walks -- High Entropy Random Selection Protocols -- Testingst-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols --
|
653 |
|
|
|a Software engineering
|
653 |
|
|
|a Computer science / Mathematics
|
653 |
|
|
|a Numerical Analysis
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Software Engineering
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Numerical analysis
|
653 |
|
|
|a Discrete mathematics
|
700 |
1 |
|
|a Jansen, Klaus
|e [editor]
|
700 |
1 |
|
|a Reingold, Omer
|e [editor]
|
700 |
1 |
|
|a Rolim, José D.P.
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
028 |
5 |
0 |
|a 10.1007/978-3-540-74208-1
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-74208-1?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 005.1
|