The minimum color sum of bipartite graphs

Amotz Bar-Noy, Guy Kortsarz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of minimum color sum of a graph is to color the vertices of the graph such that the sum (average) of all assigned colors is minimum. Recently, in [BBH+96], it was shown that in general graphs this problem cannot be approximated within n1-є, for any є > 0, unless NP = ZPP. In the same paper, a 9/8-approximation algorithm was presented for bipartite graphs. The hardness question for this problem on bipartite graphs was left open. In this paper we show that the minimum color sum problem for bipartite graphs admits no polynomial approximation scheme, unless P = NP. The proof is by L-reducing the problem of finding the maximum independent set in a graph whose maximum degree is four to this problem. This result indicates clearly that the minimum color sum problem is much harder than the traditional coloring problem which is trivially solvable in bipartite graphs. As for the approximation ratio, we make a further step towards finding the precise threshold. We present a polynomial 10/9-approximation algorithm. Our algorithm uses a flow procedure in addition to the maximum independent set procedure used in previous results.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings
EditorsPierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela
PublisherSpringer Verlag
Pages738-748
Number of pages11
ISBN (Print)3540631658, 9783540631651
DOIs
StatePublished - 1997
Externally publishedYes
Event24th International Colloquium on Automata, Languages and Programming, ICALP 1997 - Bologna, Italy
Duration: Jul 7 1997Jul 11 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1256
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other24th International Colloquium on Automata, Languages and Programming, ICALP 1997
CountryItaly
CityBologna
Period7/7/977/11/97

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The minimum color sum of bipartite graphs'. Together they form a unique fingerprint.

Cite this