OPAC

Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications / edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon
(Theoretical Computer Science and General Issues. ISSN:25122029 ; 3484)

データ種別	電子ブック
版	1st ed. 2006.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2006
大きさ	VII, 349 p : online resource
著者標目	Bampis, Evripidis editor Jansen, Klaus editor Kenyon, Claire editor SpringerLink (Online service)

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0004068	Computer Scinece R0 2005-6,2022-3				9783540322139

一般注記	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 HTTP:URL=https://doi.org/10.1007/11671541
件　名	LCSH:Algorithms LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Discrete mathematics LCSH:Numerical analysis LCSH:Computer networks LCSH:Computer graphics FREE:Algorithms FREE:Discrete Mathematics in Computer Science FREE:Numerical Analysis FREE:Computer Communication Networks FREE:Computer Graphics
分　類	LCC:QA76.9.A43 DC23:518.1
書誌ID	EB00003456
ISBN	9783540322139