Algorithms on graphs with small dominating targets

Authors:
Divesh Aggarwal;Chandan K. Dubey;Shashank K. Mehta
Affiliations:
Indian Institute of Technology, Kanpur, India;Indian Institute of Technology, Kanpur, India;Indian Institute of Technology, Kanpur, India
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 12
Cited 2

Asteroidal Triple-Free Graphs

SIAM Journal on Discrete Mathematics
On wirelength estimations for row-based placement

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Graph classes: a survey

Graph classes: a survey
Permutation Graphs and Transitive Graphs

Journal of the ACM (JACM)
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Between O(nm) and O(nα)

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
RNC-Approximation Algorithms for the Steiner Problem

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Improved Non-approximability Results for Vertex Cover with Density Constraints

COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation Algorithms for Connected Dominating Sets

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Algorithms for graphs with small octopus

Discrete Applied Mathematics

A link stability-based multicast routing protocol for wireless mobile ad hoc networks

Journal of Network and Computer Applications
Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dominating target of a graph G=(V,E) is a set of vertices T s.t. for all W⊆V, if T⊆W and induced subgraph on W is connected, then W is a dominating set of G. The size of the smallest dominating target is called dominating target number of the graph, dt(G). We provide polynomial time algorithms for minimum connected dominating set, Steiner set, and Steiner connected dominating set in dominating-pair graphs (i.e., dt(G)=2). We also give approximation algorithm for minimum connected dominating set with performance ratio 2 on graphs with small dominating targets. This is a significant improvement on appx ≤d(opt + 2) given by Fomin et.al. [2004] on graphs with small d-octopus. Classification: Dominating target, d-octopus, Dominating set, Dominating-pair graph, Steiner tree.