00802cam0 2200253 450 E60020004328620210503082311.0978019829945520081217d2008 |||||ita|0103 baengGBProperty Rights in MoneyDavid FoxOxfordNew YorkOxford University Press2008XXXIV, 334 p.25 cmFox, DavidA600200051482070351163ITUNISOB20210503RICAUNISOBUNISOB330141018E600200043286M 102 Monografia moderna SBNM330001713Si141018acquistocatenacciUNISOBUNISOB20081217091810.020210503082258.0AlfanoProperty Rights in Money1681029UNISOB01406nam 2200373 a 450 991070079320332120110705154750.0(CKB)5470000002411071(OCoLC)738499402(EXLCZ)99547000000241107120110705d2010 ua 0engurmn|||||||||txtrdacontentcrdamediacrrdacarrierRecovery Act[electronic resource] results of GAO's survey of state housing finance agencies' use of the low-income housing Tax Credit Assistance Program (TCAP) and the Section 1602 Program (GAO-10-1023SP, September 2010), an e-supplement to GAO-10-1022R /U.S. Government Accountability Office[Washington, D.C.] :U.S. Govt. Accountability Office,[2010]1 online resourceTitle from title screen (GAO, viewed June 20, 2011)."GAO-10-1023SP."Recovery Act Tax creditsUnited StatesExaminations, questions, etcMortgage loansUnited StatesExaminations, questions, etcFederal aid to housingUnited StatesTax creditsMortgage loansFederal aid to housingGPOGPOBOOK9910700793203321Recovery Act3434897UNINA05889nam 22008175 450 991014359180332120251116234205.09783540446668354044666410.1007/3-540-44666-4(CKB)1000000000211538(SSID)ssj0000321382(PQKBManifestationID)11241020(PQKBTitleCode)TC0000321382(PQKBWorkID)10262967(PQKB)11132999(DE-He213)978-3-540-44666-8(MiAaPQ)EBC4516819(PPN)155237446(EXLCZ)99100000000021153820121227d2001 u| 0engurnn#008mamaatxtccrApproximation, Randomization and Combinatorial Optimization: Algorithms and Techniques 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001 /edited by Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (IX, 296 p.)Lecture Notes in Computer Science,1611-3349 ;2129Bibliographic Level Mode of Issuance: Monograph9783540424703 3540424709 Includes bibliographical references at the end of each chapters and index.Invited Talks -- Using Complex Semidefinite Programming for Approximating MAX E2-LIN3 -- Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems -- Web Search via Hub Synthesis -- Error-Correcting Codes and Pseudorandom Projections -- Order in Pseudorandomness -- Contributed Talks of APPROX -- Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows -- On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique -- Online Weighted Flow Time and Deadline Scheduling -- An Online Algorithm for the Postman Problem with a Small Penalty -- A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem -- Approximation Schemes for Ordered Vector Packing Problems -- Incremental Codes -- A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set -- Approximation Algorithms for Budget-Constrained Auctions -- Minimizing Average Completion of Dedicated Tasks and Interval Graphs -- A Greedy Facility Location Algorithm Analyzed Using Dual Fitting -- 0.863-Approximation Algorithm for MAX DICUT -- The Maximum Acyclic Subgraph Problem and Degree-3 Graphs -- Some Approximation Results for the Maximum Agreement Forest Problem -- Contributed Talks of RANDOM -- Near-optimum Universal Graphs for Graphs with Bounded Degrees -- On a Generalized Ruin Problem -- On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation -- Exact Sampling in Machine Scheduling Problems -- On Computing Ad-hoc Selective Families -- L Infinity Embeddings -- On Euclidean Embeddings and Bandwidth Minimization -- The Non-approximability of Non-Boolean Predicates -- On the Derandomization of Constant Depth Circuits -- Testing Parenthesis Languages -- Proclaiming Dictators and Juntas or Testing Boolean Formulae -- Equitable Coloring Extends Chernoff-Hoeffding Bounds.This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.Lecture Notes in Computer Science,1611-3349 ;2129Mathematical analysisComputer programmingDiscrete mathematicsAlgorithmsNumerical analysisAnalysisProgramming TechniquesDiscrete MathematicsAlgorithmsNumerical AnalysisMathematical analysis.Computer programming.Discrete mathematics.Algorithms.Numerical analysis.Analysis.Programming Techniques.Discrete Mathematics.Algorithms.Numerical Analysis.004/.01/5114Goemans Micheledthttp://id.loc.gov/vocabulary/relators/edtJansen Klausedthttp://id.loc.gov/vocabulary/relators/edtRolim Jose D.Pedthttp://id.loc.gov/vocabulary/relators/edtTrevisan Luca(Computer scientist)edthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Randomization and Approximation Techniques in Computer Science(5th :2001 :Berkeley, Calif.)MiAaPQMiAaPQMiAaPQBOOK9910143591803321Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques772207UNINA