Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Record no. 187659)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04990nam a22006255i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-27821-4 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423132428.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 121227s2004 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540278214 |
| -- | 978-3-540-27821-4 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/b99805 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques |
| Medium | [electronic resource] : |
| Remainder of title | 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA August 22-24, 2004 , Proceedings / |
| Statement of responsibility, etc | edited by Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2004. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2004. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | X, 434 p. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| International Standard Serial Number | 1611-3349 ; |
| Volume number/sequential designation | 3122 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Contributed Talks of APPROX -- Designing Networks with Existing Traffic to Support Fast Restoration -- Simultaneous Source Location -- Computationally-Feasible Truthful Auctions for Convex Bundles -- Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks -- On the Crossing Spanning Tree Problem -- A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One -- Maximum Coverage Problem with Group Budget Constraints and Applications -- The Greedy Algorithm for the Minimum Common String Partition Problem -- Approximating Additive Distortion of Embeddings into Line Metrics -- Polylogarithmic Inapproximability of the Radio Broadcast Problem -- On Systems of Linear Equations with Two Variables per Equation -- An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case -- Cost-Sharing Mechanisms for Network Design -- Approximating Max k CSP Using Random Restrictions -- Approximation Schemes for Broadcasting in Heterogenous Networks -- Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks -- Convergence Issues in Competitive Games -- Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem -- Min-Max Multiway Cut -- Contributed Talks of RANDOM -- The Chromatic Number of Random Regular Graphs -- Estimating the Distance to a Monotone Function -- Edge Coloring with Delays -- Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption -- The Sketching Complexity of Pattern Matching -- Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions -- Robust Locally Testable Codes and Products of Codes -- A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.-Strong Refutation Heuristics for Random k-SAT -- Counting Connected Graphs and Hypergraphs via the Probabilistic Method -- Improved Randomness Extraction from Two Independent Sources -- The Diameter of Randomly Perturbed Digraphs and Some Applications -- Maximum Weight Independent Sets and Matchings in Sparse Random Graphs -- Estimating Frequency Moments of Data Streams Using Random Linear Combinations -- Fooling Parity Tests with Parity Gates -- Distribution-Free Connectivity Testing -- Testing the Independence Number of Hypergraphs -- A Note on Approximate Counting for k-DNF. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science |
| General subdivision | Mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Numerical analysis. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete Mathematics in Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Numerical Analysis. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Jansen, Klaus. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Khanna, Sanjeev. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Rolim, José D. P. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Ron, Dana. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540228943 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783662207291 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 1611-3349 ; |
| Volume number/sequential designation | 3122 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/b99805">https://doi.org/10.1007/b99805</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 912 ## - | |
| -- | ZDB-2-BAE |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.