Efficient Approximation and Online Algorithms [electronic resource] : Recent Progress on Classical Combinatorial Optimization Problems and New Applications / edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
Tipo de material:
TextoSeries Lecture Notes in Computer Science, 3484Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Descripción: VII, 349 p. Also available online. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783540322139Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Computer Communication Networks | Computer software | Electronic data processing | Computational complexity | Computer graphics | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Numeric Computing | Computer Communication Networks | Computer Graphics | AlgorithmsFormatos físicos adicionales: Sin títuloClasificación CDD: 005.1 Clasificación LoC:Libro electrónicoRecursos en línea: de clik aquí para ver el libro electrónico 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 Lovsz-Local-Lemma and Scheduling.
ZDB-2-SCS
ZDB-2-LNC
No hay comentarios en este titulo.