LEADER 06748nam 22008415 450 001 996466308103316 005 20230221224600.0 010 $a1-280-38852-8 010 $a9786613566447 010 $a3-642-15369-0 024 7 $a10.1007/978-3-642-15369-3 035 $a(CKB)2670000000036401 035 $a(SSID)ssj0000446302 035 $a(PQKBManifestationID)11297662 035 $a(PQKBTitleCode)TC0000446302 035 $a(PQKBWorkID)10495992 035 $a(PQKB)11323440 035 $a(DE-He213)978-3-642-15369-3 035 $a(MiAaPQ)EBC3065732 035 $a(PPN)149018363 035 $a(EXLCZ)992670000000036401 100 $a20100827d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$b[electronic resource] $e13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings /$fedited by Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIII, 782 p. 54 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6302 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-15368-2 320 $aIncludes bibliographical references and index. 327 $aContributed Talks of APPROX -- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem -- Improved Inapproximability for Submodular Maximization -- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems -- Submodular Secretary Problem and Extensions -- Approximation Algorithms for Min-Max Generalization Problems -- Min-Power Strong Connectivity -- The Complexity of Approximately Counting Stable Matchings -- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs -- Approximating Linear Threshold Predicates -- Approximating Sparsest Cut in Graphs of Bounded Treewidth -- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors -- Vertex Sparsifiers: New Results from Old Techniques -- PTAS for Weighted Set Cover on Unit Squares -- Improved Lower Bounds for the Universal and a priori TSP -- Proximity Algorithms for Nearly-Doubling Spaces -- Matrix Sparsification and the Sparse Null Space Problem -- The Checkpoint Problem -- The Euclidean Distortion of Flat Tori -- Online Embeddings -- Approximation Algorithms for Intersection Graphs -- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs -- Improved Algorithm for the Half-Disjoint Paths Problem -- Approximate Lasserre Integrality Gap for Unique Games -- Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses -- Maximum Flows on Disjoint Paths -- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization -- How to Schedule When You Have to Buy Your Energy -- Improving Integrality Gaps via Chvátal-Gomory Rounding -- Contributed Talks of RANDOM -- Uniform Derandomization from Pathetic Lower Bounds -- Testing Boolean Function Isomorphism -- Better Size Estimation for Sparse Matrix Products -- Low Rate Is Insufficient for Local Testability -- Reconstruction Threshold for the Hardcore Model -- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners -- Monotonicity Testing and Shortest-Path Routing on the Cube -- Better Gap-Hamming Lower Bounds via Better Round Elimination -- Propagation Connectivity of Random Hypergraphs -- Improved Pseudorandom Generators for Depth 2 Circuits -- The Structure of Winning Strategies in Parallel Repetition Games -- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries -- Periodicity in Streams -- Rumor Spreading on Random Regular Graphs and Expanders -- On Testing Computability by Small Width OBDDs -- Learning and Lower Bounds for AC 0 with Threshold Gates -- Liftings of Tree-Structured Markov Chains -- Constructive Proofs of Concentration Bounds -- Almost-Euclidean Subspaces of via Tensor Products: A Simple Approach to Randomness Reduction -- Testing Outerplanarity of Bounded Degree Graphs -- Two-Source Extractors Secure against Quantum Adversaries -- Locally Testable vs. Locally Decodable Codes -- Differential Privacy and the Fat-Shattering Dimension of Linear Queries -- Two Theorems on List Decoding -- Delaying Satisfiability for Random 2SAT -- Improved Rounding for Parallel Repeated Unique Games -- A Query Efficient Non-adaptive Long Code Test with Perfect Completeness -- Relativized Worlds without Worst-Case to Average-Case Reductions for NP -- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6302 606 $aComputer programming 606 $aComputer networks 606 $aComputer science 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 14$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a005.1 702 $aSerna$b Maria$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShaltiel$b Ronen$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRolim$b José$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Randomization and Computation$d(14th :$f2010 :$eBarcelona, Spain) 906 $aBOOK 912 $a996466308103316 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207 997 $aUNISA LEADER 01913oam 22006255 450 001 9910783108203321 005 20200520144314.0 010 $a1-280-08399-9 010 $a9786610083992 010 $a1-4175-6189-0 024 7 $a10.1596/0-8213-5716-6 035 $a(CKB)1000000000018227 035 $a(OCoLC)57227947 035 $a(CaPaEBR)ebrary10070364 035 $a(SSID)ssj0000085187 035 $a(PQKBManifestationID)11123717 035 $a(PQKBTitleCode)TC0000085187 035 $a(PQKBWorkID)10009305 035 $a(PQKB)11506089 035 $a(MiAaPQ)EBC3050755 035 $a(Au-PeEL)EBL3050755 035 $a(CaPaEBR)ebr10070364 035 $a(CaONFJC)MIL8399 035 $a(OCoLC)872005431 035 $a(The World Bank)2004045528 035 $a(US-djbf)13507267 035 $a(EXLCZ)991000000000018227 100 $a20040301d2005 uf 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAccess to financial services in Brazil /$fa study led by Anjali Kumar 210 1$aWashington, D.C. :$cWorld Bank,$dc2005. 215 $alxxii, 619 pages $cillustrations ;$d23 cm 225 1 $aDirections in development 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a0-8213-5716-6 320 $aIncludes bibliographical references and index. 410 0$aDirections in development (Washington, D.C.). 410 0$aWorld Bank e-Library. 606 $aFinance$zBrazil 606 $aFinancial institutions$zBrazil 615 0$aFinance 615 0$aFinancial institutions 676 $a332.1/7/0981 700 $aKumar$b Anjali$01494496 801 0$bDLC 801 1$bDLC 801 2$bDLC 906 $aBOOK 912 $a9910783108203321 996 $aAccess to financial services in Brazil$93782506 997 $aUNINA