- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Parameterized and Approximation Algorithms for the Load Coloring Problem ; day:30 ; month:11 ; year:2016 ; pages:1-19
Algorithmica ; (30.11.2016), 1-19
- Creator
-
Barbero, F.
- Contributor
-
Gutin, G.
Jones, M.
Sheng, B.
SpringerLink (Online service)
- DOI
-
10.1007/s00453-016-0259-z
- URN
-
urn:nbn:de:1111-201612196197
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:47 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Barbero, F.
- Gutin, G.
- Jones, M.
- Sheng, B.
- SpringerLink (Online service)
Other Objects (12)
Parameterized approximation algorithms for orienteering
Parameterized Mixed Graph Coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for the interval constrained coloring problem
Approximation and online algorithms in scheduling and coloring
b-Coloring Parameterized by Clique-Width
Parallel parameterized algorithms
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Improved distributed fractional coloring algorithms
Approximation the Interval Constrained Coloring Problem
Efficient parameterized algorithms on structured graphs
Approximation algorithms
Parameterized approximation algorithms for orienteering
Parameterized Mixed Graph Coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for the interval constrained coloring problem
Approximation and online algorithms in scheduling and coloring
b-Coloring Parameterized by Clique-Width
Parallel parameterized algorithms
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Improved distributed fractional coloring algorithms
Approximation the Interval Constrained Coloring Problem
Efficient parameterized algorithms on structured graphs
Approximation algorithms
Parameterized approximation algorithms for orienteering
Parameterized Mixed Graph Coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for the interval constrained coloring problem
Approximation and online algorithms in scheduling and coloring
b-Coloring Parameterized by Clique-Width
Parallel parameterized algorithms
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Improved distributed fractional coloring algorithms
Approximation the Interval Constrained Coloring Problem
Efficient parameterized algorithms on structured graphs