000 03719nam a22003855i 4500
001 298123
003 MX-SnUAN
005 20160429155449.0
007 cr nn 008mamaa
008 150903s2008 gw | o |||| 0|eng d
020 _a9783540779186
_99783540779186
024 7 _a10.1007/9783540779186
_2doi
035 _avtls000351556
039 9 _a201509030449
_bVLOAD
_c201405060252
_dVLOAD
_y201402171139
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aKaklamanis, Christos.
_eeditor.
_9334299
245 1 0 _aApproximation and Online Algorithms :
_b5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers /
_cedited by Christos Kaklamanis, Martin Skutella.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4927
500 _aSpringer eBooks
505 0 _aPricing Commodities, or How to Sell When Buyers Have Restricted Valuations -- Improved Lower Bounds for Non-utilitarian Truthfulness -- Buyer-Supplier Games: Optimization over the Core -- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines -- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays -- Online Algorithm for Parallel Job Scheduling and Strip Packing -- Geometric Spanners with Small Chromatic Number -- Approximating Largest Convex Hulls for Imprecise Points -- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem -- Covering the Edges of Bipartite Graphs Using K 2,2 Graphs -- On Min-Max r-Gatherings -- On the Max Coloring Problem -- Full and Local Information in Distributed Decision Making -- The Minimum Substring Cover Problem -- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Online Unit Clustering Problem -- Better Bounds for Incremental Medians -- Minimum Weighted Sum Bin Packing -- Approximation Schemes for Packing Splittable Items with Cardinality Constraints -- A Randomized Algorithm for Two Servers in Cross Polytope Spaces -- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems -- Online Rectangle Filling.
520 _aThis book constitutes the thoroughly refereed post workshop proceedings of the 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, held in Eilat, Israel, in October 2007 as part of the ALGO 2007 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aSkutella, Martin.
_eeditor.
_9334300
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540779179
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-77918-6
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c298123
_d298123