LEADER 01859nam 2200421Ia 450 001 9910701300603321 005 20111202152114.0 035 $a(CKB)5470000002416047 035 $a(OCoLC)766004654 035 $a(EXLCZ)995470000002416047 100 $a20111202d2010 ua 0 101 0 $aeng 135 $aurbn||||a|||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 12$aA retrospective analysis of the clinical quality effects of the acquisition of Highland Park Hospital by Evanston Northwestern Healthcare$b[electronic resource] /$fPatrick S. Romano, David J. Balan 210 1$aWashington, DC :$cBureau of Economics, Federal Trade Commission,$d[2010] 215 $a1 online resource (29 pages) 225 1 $aWorking paper ;$vno. 307 300 $aTitle from title screen (viewed on Dec. 2, 2011). 300 $a"November 2010." 320 $aIncludes bibliographical references (pages 25-27). 606 $aHospital mergers$zIllinois$zHighland Park$xEconometric models 606 $aConsolidation and merger of corporations$zIllinois$zHighland Park$xEconometric models 606 $aMedical care$zIllinois$zHighland Park$xQuality control$xEconometric models 615 0$aHospital mergers$xEconometric models. 615 0$aConsolidation and merger of corporations$xEconometric models. 615 0$aMedical care$xQuality control$xEconometric models. 700 $aRomano$b Patrick S$01402808 701 $aBalan$b David J$01393230 712 02$aUnited States.$bFederal Trade Commission.$bBureau of Economics. 801 0$bGPO 801 1$bGPO 906 $aBOOK 912 $a9910701300603321 996 $aA retrospective analysis of the clinical quality effects of the acquisition of Highland Park Hospital by Evanston Northwestern Healthcare$93520940 997 $aUNINA LEADER 01081nas 2200361 c 450 001 9910142104503321 005 20250513220613.0 035 $a(CKB)1000000000528753 035 $a(DE-599)ZDB2240399-1 035 $a(OCoLC)1184359679 035 $a(OCoLC)645061560 035 $a(DE-101)980266742 035 $a(EXLCZ)991000000000528753 100 $a20060626a20009999 |y | 101 0 $ager 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aOrientierungsrahmen ... / Akademie für Raumforschung und Landesplanung$eForschungsperspektiven der ARL = ˜theœ ARL's research framework for .. 210 31$aHannover$cARL$d2000- 215 $aOnline-Ressource 517 1 $a˜theœ ARL's research framework for ... 517 1 $aForschungsperspektiven der ARL 608 $aZeitschrift$2gnd-content 676 $a910 801 0$b8999 801 1$bDE-101 801 2$b9999 906 $aJOURNAL 912 $a9910142104503321 996 $aOrientierungsrahmen ...$92050512 997 $aUNINA LEADER 05142nam 22006735 450 001 9910483161103321 005 20251226202719.0 024 7 $a10.1007/11538462 035 $a(CKB)1000000000213185 035 $a(SSID)ssj0000316309 035 $a(PQKBManifestationID)11205455 035 $a(PQKBTitleCode)TC0000316309 035 $a(PQKBWorkID)10275215 035 $a(PQKB)10975978 035 $a(DE-He213)978-3-540-31874-3 035 $a(MiAaPQ)EBC3067939 035 $a(PPN)123096766 035 $a(EXLCZ)991000000000213185 100 $a20100928d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques $e8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings /$fedited by Chandra Chekuri, Klaus Jansen, José D.P. Rolim, Luca Trevisan 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XI, 495 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3624 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-31874-7 311 08$a3-540-28239-4 320 $aIncludes bibliographical references and index. 327 $aContributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the Bandwidth of Caterpillars -- Where?s the Winner? Max-Finding and Sorting with Metric Costs -- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization -- The Complexity of Making Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit Tree Under L p Norms -- Beating a Random Assignment -- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints -- Approximation Algorithms for Network Design and Facility Location with Service Capacities -- Finding Graph Matchings in Data Streams -- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses -- Efficient Approximation of Convex Recolorings -- Approximation Algorithms for Requirement Cut on Graphs -- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems -- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy -- Contributed Talks of RANDOM -- Bounds for Error Reduction with Few Quantum Queries -- Sampling Bounds for Stochastic Optimization -- An Improved Analysis of Mergers -- Finding a Maximum Independent Set in a Sparse Random Graph -- On the Error Parameter of Dispersers -- Tolerant Locally Testable Codes -- A Lower Bound on List Size for List Decoding -- A Lower Bound for Distribution-Free Monotonicity Testing -- On Learning Random DNF Formulas Under the Uniform Distribution.-Derandomized Constructions of k-Wise (Almost) Independent Permutations -- Testing Periodicity -- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem -- The Online Clique Avoidance Game on Random Graphs -- A Generating Function Method for the Average-Case Analysis of DPLL -- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas -- Mixing Points on a Circle -- Derandomized Squaring of Graphs -- Tight Bounds for String Reconstruction Using Substring Queries -- Reconstructive Dispersers and Hitting Set Generators -- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable -- Fractional Decompositions of Dense Hypergraphs. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3624 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.1 701 $aChekuri$b Chandra$01754273 712 12$aInternational Workshop on Randomization and Computation$d(9th :$f2005 :$eBerkeley, Calif.) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483161103321 996 $aApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques$94520487 997 $aUNINA