Advances in greedy algorithms

Bednorz W.9789537619275, 9537619273

Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems.

---

Table of contents :
Preface&Contents_Greedy_Algorithms……Page 1
01_Chen_Mao……Page 11
02_Bejerano……Page 27
03_Bouhmala……Page 49
04_Takahara……Page 65
05_Huo……Page 79
06_Lidoris……Page 95
07_Akujuobi……Page 113
08_Haider……Page 141
09_Vidrighin……Page 161
10_Mingyu……Page 179
11_Jones……Page 203
12_Farah……Page 233
13_Cheng……Page 255
14_Meghanathan……Page 263
15_Liu……Page 283
16_Gutin……Page 301
17_Chen……Page 315
18_Bednorz……Page 335
19_Yoshikawa……Page 369
20_Nghia……Page 379
21_Ciftcioglu……Page 397
22_Fukuta……Page 421
23_Wei……Page 441
24_He……Page 449
25_Kempner……Page 471
26_Bellur……Page 491
27_Ho……Page 513
28_Chorbev……Page 539
29_Yoshida……Page 563
30_Skorin-Kapov……Page 579