LEADER 00554nam 2200169z- 450 001 9910693719403321 035 $a(CKB)4970000000016707 035 $a(EXLCZ)994970000000016707 100 $a20240129c2003uuuu -u- - 101 0 $aeng 200 00$aAviation security : Federal Air Marshal Service is addressing challenges of its expanded mission and workforce, but additional actions needed 210 $aWashington, D.C 517 $aAviation Security 906 $aDOCUMENT 912 $a9910693719403321 996 $aAviation security$92879064 997 $aUNINA LEADER 00535nam 2200169z- 450 001 9910693888503321 035 $a(CKB)4970000000020864 035 $a(EXLCZ)994970000000020864 100 $a20240129c2004uuuu -u- - 101 0 $aeng 200 00$aContract management : Coast Guard's Deepwater program needs increased attention to management and contractor oversight 210 $aWashington, D.C 517 $aContract Management 906 $aDOCUMENT 912 $a9910693888503321 996 $aContract management$92345250 997 $aUNINA LEADER 04413nam 22007215 450 001 9910485140503321 005 20251226193457.0 010 $a3-319-18263-3 024 7 $a10.1007/978-3-319-18263-6 035 $a(CKB)3710000000404093 035 $a(SSID)ssj0001501337 035 $a(PQKBManifestationID)11830585 035 $a(PQKBTitleCode)TC0001501337 035 $a(PQKBWorkID)11523995 035 $a(PQKB)11225414 035 $a(DE-He213)978-3-319-18263-6 035 $a(MiAaPQ)EBC6283641 035 $a(MiAaPQ)EBC5586430 035 $a(Au-PeEL)EBL5586430 035 $a(OCoLC)908388449 035 $a(PPN)185489257 035 $a(EXLCZ)993710000000404093 100 $a20150422d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation and Online Algorithms $e12th International Workshop, WAOA 2014, Wroc?aw, Poland, September 11-12, 2014, Revised Selected Papers /$fedited by Evripidis Bampis, Ola Svensson 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (X, 273 p. 29 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8952 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-319-18262-5 320 $aIncludes bibliographical references and index. 327 $aImproved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems. 330 $aThis book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wroc?aw, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8952 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 676 $a005.1 702 $aBampis$b Evripidis$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSvensson$b Ola$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910485140503321 996 $aApproximation and Online Algorithms$92954916 997 $aUNINA