Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Record no. 34537)

000 -LEADER
fixed length control field 05184nam a22005895i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540451983
-- 978-3-540-45198-3
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Sub Title 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, Princeton, NJ, USA, August 24-26, 2003. Proceedings /
Statement of responsibility, etc edited by Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 2003.
300 ## - PHYSICAL DESCRIPTION
Number of Pages IX, 411 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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 k-Center Variants -- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times -- On the Complexity of Approximating k-Dimensional Matching -- Approximating Market Equilibria -- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem -- On the Hardness of Approximate Multivariate Integration -- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem -- Approximating Rooted Connectivity Augmentation Problems -- Effective Routing and Scheduling in Adversarial Queueing Networks -- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement -- An Improved Algorithm for Approximating the Radii of Point Sets -- Contributed Talks of RANDOM -- Testing Low-Degree Polynomials over GF(2) -- Computational Analogues of Entropy -- Bounds on 2-Query 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 -- Continuous-Time Quantum Walks on the Symmetric Group -- Distribution-Free Property Testing -- On the Graph-Density of Random 0/1-Polytopes -- 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 4-Min-Wise Independent Permutation Family by Finite Geometries.
520 ## - SUMMARY, ETC.
Summary, etc 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, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Electronic data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Numeric Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Arora, Sanjeev.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Jansen, Klaus.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rolim, José D. P.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sahai, Amit.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/b11961
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2003.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK5243 http://dx.doi.org/10.1007/b11961 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha