05734nam 22007695 450 99646607530331620230221101717.03-540-74208-510.1007/978-3-540-74208-1(CKB)1000000000490331(SSID)ssj0000316311(PQKBManifestationID)11242666(PQKBTitleCode)TC0000316311(PQKBWorkID)10275350(PQKB)11656630(DE-He213)978-3-540-74208-1(MiAaPQ)EBC3063673(MiAaPQ)EBC6284029(PPN)152166637(EXLCZ)99100000000049033120100301d2007 u| 0engurnn|008mamaatxtccrApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques[electronic resource] 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings /edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (XII, 628 p.) Theoretical Computer Science and General Issues,2512-2029 ;4627Bibliographic Level Mode of Issuance: Monograph3-540-74207-7 Includes bibliographical references and index.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 -- 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 -- Testing st-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols -- 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.Theoretical Computer Science and General Issues,2512-2029 ;4627Software engineeringAlgorithmsComputer science—MathematicsDiscrete mathematicsNumerical analysisSoftware EngineeringAlgorithmsDiscrete Mathematics in Computer ScienceNumerical AnalysisSoftware engineering.Algorithms.Computer science—Mathematics.Discrete mathematics.Numerical analysis.Software Engineering.Algorithms.Discrete Mathematics in Computer Science.Numerical Analysis.005.1Charikar Mosesedthttp://id.loc.gov/vocabulary/relators/edtJansen Klausedthttp://id.loc.gov/vocabulary/relators/edtReingold Omeredthttp://id.loc.gov/vocabulary/relators/edtRolim José D.Pedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Randomization and Computation(11th :2007 :Princeton, N.J.)MiAaPQMiAaPQMiAaPQBOOK996466075303316Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques772207UNISA