03381nam 2200649 a 450 991048422960332120251117003051.03-540-32213-210.1007/11671541(CKB)1000000000232815(SSID)ssj0000317351(PQKBManifestationID)11247728(PQKBTitleCode)TC0000317351(PQKBWorkID)10292903(PQKB)11416650(DE-He213)978-3-540-32213-9(MiAaPQ)EBC3067924(PPN)123131413(BIP)28220783(BIP)13248081(EXLCZ)99100000000023281520060104d2006 uy 0engurnn|008mamaatxtccrEfficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications /Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)1st ed. 2006.New York Springer20061 online resource (VII, 349 p.) Lecture notes in computer science,0302-9743 ;3484LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-540-32212-4 Includes bibliographical references and index.Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling.This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.Lecture notes in computer science ;3484.LNCS sublibrary.SL 1,Theoretical computer science and general issues.Computer algorithmsOnline algorithmsCombinatorial optimizationData processingComputer algorithms.Online algorithms.Combinatorial optimizationData processing.005.1Bampis Evripidis1754801Jansen Klaus867301Kenyon Claire1754802MiAaPQMiAaPQMiAaPQBOOK9910484229603321Efficient approximation and online algorithms4191296UNINA