Knihobot

Efficient approximation and online algorithms

Parametry

  • 349 stránek
  • 13 hodin čtení

Více o knize

InhaltsverzeichnisContributed 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.

Nákup knihy

Efficient approximation and online algorithms, Evripidis Bampis

Jazyk
Rok vydání
2006
product-detail.submit-box.info.binding
(měkká)
Jakmile se objeví, pošleme e-mail.

Doručení

Platební metody

Nikdo zatím neohodnotil.Ohodnotit