Online algorithms for the maximum k-colorable subgraph problem
Year of publication: |
March 2018
|
---|---|
Authors: | Hertz, Alain ; Montagné, Romain ; Gagnon, François |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 91.2018, p. 209-224
|
Subject: | Online algorithms | Maximum k-colorable subgraph | Sequential vertex coloring | Competitive analysis | Theorie | Theory | Algorithmus | Algorithm |
-
Dai, Wenqiang, (2016)
-
Bin packing problem with scenarios
Bódis, Attila, (2019)
-
Schroeder, Pascal, (2019)
- More ...
-
A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection
Montagné, Romain, (2019)
-
Integer linear programming models for a cement delivery problem
Hertz, Alain, (2012)
-
A Tabu Search Heuristic for the Vehicle Routing Problem
Gendreau, Michel, (1994)
- More ...