On Chromatic Sums and Distributed Resource Allocation

This publication has 5 references indexed in Scilit:

• Approximating maximum independent sets by excluding subgraphs
  BIT Numerical Mathematics, 1992
• A Heuristic of Scheduling Parallel Tasks and Its Analysis
  SIAM Journal on Computing, 1992
• The drinking philosophers problem
  ACM Transactions on Programming Languages and Systems, 1984
• Upper bounds for static resource allocation in a distributed system
  Journal of Computer and System Sciences, 1981
• Bounds for Multiprocessor Scheduling with Resource Constraints
  SIAM Journal on Computing, 1975