Minimum Color Sum of Bipartite Graphs
Authors:
- Amotz Bar-NoyABAmotz Bar-Noy
- Guy KortsarzGKGuy Kortsarz
- 31 August 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 28 (2) , 339-365
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Zero Knowledge and the Chromatic NumberJournal of Computer and System Sciences, 1998
- On Chromatic Sums and Distributed Resource AllocationInformation and Computation, 1998
- Greed is good: Approximating independent sets in sparse and bounded-degree graphsAlgorithmica, 1997
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Approximation algorithms for the chromatic sum1991
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- An introduction to chromatic sums1989
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984
- Efficient bounds for the stable set, vertex cover and set packing problemsDiscrete Applied Mathematics, 1983
- Upper bounds for static resource allocation in a distributed systemJournal of Computer and System Sciences, 1981