DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Article >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/10054/3338

Title: A (2+epsilon)-approximation scheme for minimum domination on circle graphs
Authors: DAMIAN-IORDACHE, M
PEMMARAJU, SV
Keywords: approximation algorithms
combinatorial
Issue Date: 2002
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Citation: JOURNAL OF ALGORITHMS, 42(2), 255-276
Abstract: The main result of this paper is a (2 + epsilon)-approximation scheme for the minimum dominating set problem on circle graphs. We first present an O(n(2)) time 8-approximation algorithm for this problem and then extend it to an O(n(3) + 6/epsilonn([6/epsilon+1])m) time (2 + epsilon)-approximation scheme for this problem. Here n and m are the number of vertices and the number of edges of the circle graph. We then present simple modifications to this algorithm that yield (3 + epsilon)-approximation schemes for the minimum connected and the minimum total dominating set problems on circle graphs. Keil (1993, Discrete Appl. Math. 42, 51-63) shows that these problems are NP-complete for circle graphs and leaves open the problem of devising approximation algorithms for them. These are the first O(1)-approximation algorithms for domination problems on circle graphs. .
URI: http://dx.doi.org/10.1006/jagm.2001.1206
http://dspace.library.iitb.ac.in/xmlui/handle/10054/3338
http://hdl.handle.net/10054/3338
ISSN: 0196-6774
Appears in Collections:Article

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback