Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)
The Resource Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)
Resource Information
The item Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, errorcorrecting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications
 Language

 eng
 eng
 Edition
 1st ed. 2003.
 Extent
 1 online resource (IX, 411 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Contributed Talks of APPROX
 Correlation Clustering with Partial Information
 Improved Linear Time Approximation Algorithms for Weighted Matchings
 Covering Graphs Using Trees and Stars
 An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
 Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
 Asymmetry in kCenter Variants
 An FPTAS for Quickest Multicommodity Flows with InflowDependent Transit Times
 On the Complexity of Approximating kDimensional Matching
 Approximating Market Equilibria
 Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem
 On the Hardness of Approximate Multivariate Integration
 A 2Approximation Algorithm for the SoftCapacitated Facility Location Problem
 Approximating Rooted Connectivity Augmentation Problems
 Effective Routing and Scheduling in Adversarial Queueing Networks
 Approximation Schemes for Generalized 2Dimensional Vector Packing with Application to Data Placement
 An Improved Algorithm for Approximating the Radii of Point Sets
 Contributed Talks of RANDOM
 Testing LowDegree Polynomials over GF(2)
 Computational Analogues of Entropy
 Bounds on 2Query Codeword Testing
 The LovĂˇsz Number of Random Graphs
 Perfectly Balanced Allocation
 On Extracting Private Randomness over a Public Channel
 High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
 The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems
 ContinuousTime Quantum Walks on the Symmetric Group
 DistributionFree Property Testing
 On the GraphDensity of Random 0/1Polytopes
 A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding
 Tight Bounds for Testing Bipartiteness in General Graphs
 Discrete Quantum Walks Hit Exponentially Faster
 Approximate Testing of Visual Properties
 Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances
 A Nearly Linear Size 4MinWise Independent Permutation Family by Finite Geometries
 Isbn
 9783540451983
 Label
 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003
 Title
 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
 Title remainder
 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003
 Statement of responsibility
 edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai
 Subject

 Numeric Computing
 Optimization
 Software engineering
 Computer software
 Algorithm Analysis and Problem Complexity
 Mathematical optimization
 Computational complexity
 Electronic data processing
 Discrete Mathematics in Computer Science
 Software Engineering/Programming and Operating Systems
 Algorithms
 Algorithms
 Language

 eng
 eng
 Summary
 This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, errorcorrecting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications
 Dewey number
 005.1
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 rvGydVDagow
 jF0g_KPrTaw
 aN2eGn8N0PU
 I3d0KRiw8no
 Image bit depth
 0
 Language note
 English
 LC call number
 QA76.758
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2003
 http://bibfra.me/vocab/lite/meetingName
 International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorDate
 2003
 http://library.link/vocab/relatedWorkOrContributorName

 International Workshop on Randomization and Approximation Techniques in Computer Science
 Arora, Sanjeev.
 Jansen, Klaus.
 Rolim, Jose D.P.
 Sahai, Amit.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 2764
 http://library.link/vocab/subjectName

 Software engineering
 Mathematical optimization
 Computer software
 Electronic data processing
 Computational complexity
 Algorithms
 Software Engineering/Programming and Operating Systems
 Optimization
 Algorithm Analysis and Problem Complexity
 Numeric Computing
 Discrete Mathematics in Computer Science
 Algorithms
 Label
 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Contributed Talks of APPROX  Correlation Clustering with Partial Information  Improved Linear Time Approximation Algorithms for Weighted Matchings  Covering Graphs Using Trees and Stars  An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor  Approximation Algorithms for Channel Allocation Problems in Broadcast Networks  Asymmetry in kCenter Variants  An FPTAS for Quickest Multicommodity Flows with InflowDependent Transit Times  On the Complexity of Approximating kDimensional Matching  Approximating Market Equilibria  Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem  On the Hardness of Approximate Multivariate Integration  A 2Approximation Algorithm for the SoftCapacitated Facility Location Problem  Approximating Rooted Connectivity Augmentation Problems  Effective Routing and Scheduling in Adversarial Queueing Networks  Approximation Schemes for Generalized 2Dimensional Vector Packing with Application to Data Placement  An Improved Algorithm for Approximating the Radii of Point Sets  Contributed Talks of RANDOM  Testing LowDegree Polynomials over GF(2)  Computational Analogues of Entropy  Bounds on 2Query Codeword Testing  The LovĂˇsz Number of Random Graphs  Perfectly Balanced Allocation  On Extracting Private Randomness over a Public Channel  High Degree Vertices and Eigenvalues in the Preferential Attachment Graph  The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems  ContinuousTime Quantum Walks on the Symmetric Group  DistributionFree Property Testing  On the GraphDensity of Random 0/1Polytopes  A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding  Tight Bounds for Testing Bipartiteness in General Graphs  Discrete Quantum Walks Hit Exponentially Faster  Approximate Testing of Visual Properties  Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances  A Nearly Linear Size 4MinWise Independent Permutation Family by Finite Geometries
 Dimensions
 unknown
 Edition
 1st ed. 2003.
 Extent
 1 online resource (IX, 411 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540451983
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/b11961
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000212116
 (SSID)ssj0000321381
 (PQKBManifestationID)11283926
 (PQKBTitleCode)TC0000321381
 (PQKBWorkID)10263551
 (PQKB)10473254
 (DEHe213)9783540451983
 (MiAaPQ)EBC4516828
 (EXLCZ)991000000000212116
 Label
 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Contents
 Contributed Talks of APPROX  Correlation Clustering with Partial Information  Improved Linear Time Approximation Algorithms for Weighted Matchings  Covering Graphs Using Trees and Stars  An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor  Approximation Algorithms for Channel Allocation Problems in Broadcast Networks  Asymmetry in kCenter Variants  An FPTAS for Quickest Multicommodity Flows with InflowDependent Transit Times  On the Complexity of Approximating kDimensional Matching  Approximating Market Equilibria  Approximating the DegreeBounded Minimum Diameter Spanning Tree Problem  On the Hardness of Approximate Multivariate Integration  A 2Approximation Algorithm for the SoftCapacitated Facility Location Problem  Approximating Rooted Connectivity Augmentation Problems  Effective Routing and Scheduling in Adversarial Queueing Networks  Approximation Schemes for Generalized 2Dimensional Vector Packing with Application to Data Placement  An Improved Algorithm for Approximating the Radii of Point Sets  Contributed Talks of RANDOM  Testing LowDegree Polynomials over GF(2)  Computational Analogues of Entropy  Bounds on 2Query Codeword Testing  The LovĂˇsz Number of Random Graphs  Perfectly Balanced Allocation  On Extracting Private Randomness over a Public Channel  High Degree Vertices and Eigenvalues in the Preferential Attachment Graph  The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems  ContinuousTime Quantum Walks on the Symmetric Group  DistributionFree Property Testing  On the GraphDensity of Random 0/1Polytopes  A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding  Tight Bounds for Testing Bipartiteness in General Graphs  Discrete Quantum Walks Hit Exponentially Faster  Approximate Testing of Visual Properties  Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances  A Nearly Linear Size 4MinWise Independent Permutation Family by Finite Geometries
 Dimensions
 unknown
 Edition
 1st ed. 2003.
 Extent
 1 online resource (IX, 411 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540451983
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/b11961
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000212116
 (SSID)ssj0000321381
 (PQKBManifestationID)11283926
 (PQKBTitleCode)TC0000321381
 (PQKBWorkID)10263551
 (PQKB)10473254
 (DEHe213)9783540451983
 (MiAaPQ)EBC4516828
 (EXLCZ)991000000000212116
Subject
 Algorithm Analysis and Problem Complexity
 Algorithms
 Algorithms
 Computational complexity
 Computer software
 Discrete Mathematics in Computer Science
 Electronic data processing
 Mathematical optimization
 Numeric Computing
 Optimization
 Software Engineering/Programming and Operating Systems
 Software engineering
Member of
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/ApproximationRandomizationandCombinatorial/F84089iD9as/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/ApproximationRandomizationandCombinatorial/F84089iD9as/">Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/ApproximationRandomizationandCombinatorial/F84089iD9as/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/ApproximationRandomizationandCombinatorial/F84089iD9as/">Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 2426,2003, edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>