Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Distributed operating systems
A coloring problem for weighted graphs
Information Processing Letters
On the efficiency of polynomial time approximation schemes
Information Processing Letters
On chromatic sums and distributed resource allocation
Information and Computation
Journal of Algorithms
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On slot reuse for isochronous services in DQDB networks
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Scheduling Algorithms
Dynamic Co-Scheduling of Distributed Computation and Replication
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Weighted Coloring: further complexity and approximability results
Information Processing Letters
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Approximation algorithms for the max-coloring problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Max-Coloring Paths: Tight Bounds and Extensions
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximating the max-edge-coloring problem
Theoretical Computer Science
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms (TALG)
Improved approximation algorithms for the max-edge coloring problem
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Clique clustering yields a PTAS for max-coloring interval graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Max-coloring paths: tight bounds and extensions
Journal of Combinatorial Optimization
Theoretical Computer Science
| Hi-index | 0.00 |
A batch is a set of jobs that start execution at the same time; only when the last job is completed can the next batch be started. When there are constraints or conflicts between the jobs, we need to ensure that jobs in the same batch be non-conflicting. That is, we seek a coloring of the conflict graph. The two most common objectives of schedules and colorings are the makespan, or the maximum job completion time, and the sum of job completion times. This gives rise to two types of batch coloring problems: max-coloringand batch sum coloring, respectively.We give the first polynomial time approximation schemesfor batch sum coloring on several classes of "non-thick" graphs that arise in applications. This includes paths, trees, partial k-trees, and planar graphs. Also, we give an improved O(nlogn) exact algorithm for the max-coloring problem on paths.