000 05322nam a22006015i 4500
001 978-3-540-74208-1
003 DE-He213
005 20240730191015.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540742081
_9978-3-540-74208-1
024 7 _a10.1007/978-3-540-74208-1
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
_h[electronic resource] :
_b10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings /
_cedited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXII, 628 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4627
505 0 _aContributed 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 -- Testingst-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.
650 0 _aSoftware engineering.
_94138
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
700 1 _aCharikar, Moses.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144819
700 1 _aJansen, Klaus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144820
700 1 _aReingold, Omer.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144821
700 1 _aRolim, José D.P.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144822
710 2 _aSpringerLink (Online service)
_9144823
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540742074
776 0 8 _iPrinted edition:
_z9783540842200
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4627
_9144824
856 4 0 _uhttps://doi.org/10.1007/978-3-540-74208-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93569
_d93569