Results 1  10
of
13
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 355 (9 self)
 Add to MetaCart
(Show Context)
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of O(H (\Delta)) are presented, where \Delta is the maximum degree, and H is the harmonic function. This question also arises in relation to the traveling tourist problem, where one is looking for the shortest tour such that each vertex is either visited, or has at least one of its neighbors visited. We study a generalization of the problem when the vertices have weights, and give an algorithm which achieves a performance ratio of 3 ln n. We also consider the ...
The NPcompleteness column: an ongoing guide
 JOURNAL OF ALGORITHMS
, 1987
"... This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freem ..."
Abstract

Cited by 220 (0 self)
 Add to MetaCart
(Show Context)
This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freeman & Co., New York, 1979 (hereinafter referred to as "[G&J]"; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed, and, when appropriate, crossreferences will be given to that book and the list of problems (NPcomplete and harder) presented there. Readers who have results they would like mentioned (NPhardness, PSPACEhardness, polynomialtimesolvability, etc.) or open problems they would like publicized, should
Greedy Randomized Adaptive Search Procedures For The Steiner Problem In Graphs
 QUADRATIC ASSIGNMENT AND RELATED PROBLEMS, VOLUME 16 OF DIMACS SERIES ON DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1999
"... We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions ..."
Abstract

Cited by 115 (31 self)
 Add to MetaCart
We describe four versions of a Greedy Randomized Adaptive Search Procedure (GRASP) for finding approximate solutions of general instances of the Steiner Problem in Graphs. Di#erent construction and local search algorithms are presented. Preliminary computational results with one of the versions on a variety of test problems are reported. On the majority of instances from the ORLibrary, a set of standard test problems, the GRASP produced optimal solutions. On those that optimal solutions were not found, the GRASP found good quality approximate solutions.
Connected Domination and Spanning Trees with Many Leaves
 SIAM J. Discrete Math
, 2000
"... Abstract Let G = (V; E) be a connected graph. A connected dominating set S ae V is a dominating set that induces a connected subgraph of G. The connected domination number of G, denoted fl ..."
Abstract

Cited by 26 (6 self)
 Add to MetaCart
(Show Context)
Abstract Let G = (V; E) be a connected graph. A connected dominating set S ae V is a dominating set that induces a connected subgraph of G. The connected domination number of G, denoted fl
Strongly orderable graphs  A common generalization of strongly chordal and chordal bipartite graphs
, 2000
"... In this paper those graphs are studied for which a socalled strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way. We consider two characteristic elimination o ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper those graphs are studied for which a socalled strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way. We consider two characteristic elimination orderings for strongly orderable graphs, one on the vertex set and the second on the edge set, and prove that these graphs can be recognized in O(V  + E)V  time. Moreover, a special strong ordering of a strongly orderable graph can be produced in the same time bound. We present variations of greedy algorithms that compute a minimum coloring, a maximum clique, a minimum clique partition and a maximum independent set of a strongly orderable graph in linear time if such a special strong ordering is given. ? 2000 Elsevier Science B.V. All rights reserved. Keywords: Strongly chordal graphs; Chordal bipartite graphs; Strong ordering; Simple elimination ordering; Bisimplicial edge withou...
HTgraphs: centers, connected rdomination and Steiner trees
 COMPUTER SCIENCE JOURNAL OF MOLDOVA
, 1993
"... HTgraphs have been introduced in [11] and investigated with respect to location problems on graphs. In this paper two new characterizations of these graphs are given and then it is shown that the central vertex, connected rdomination and Steiner trees problems are linear or almost linear time solv ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
HTgraphs have been introduced in [11] and investigated with respect to location problems on graphs. In this paper two new characterizations of these graphs are given and then it is shown that the central vertex, connected rdomination and Steiner trees problems are linear or almost linear time solvable in HTgraphs.
Algorithms
"... In the last quarter of the century there has been a growing interest in the design and analysis of algorithms in different branches of mathematics, science and engineering. In particular, within the past 15 years there has appeared a wealth of literature on algorithms in graph theory, a significant ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the last quarter of the century there has been a growing interest in the design and analysis of algorithms in different branches of mathematics, science and engineering. In particular, within the past 15 years there has appeared a wealth of literature on algorithms in graph theory, a significant part of which is related to domination in graphs. Since there are well over one hundred papers on domination or dominationrelated algorithms, this chapter will necessarily have to focus on a limited collection of these algorithms. The intention of this chapter on domination algorithms for special graph classes is twofold. The major goal is to demonstrate some of the main techniques for designing efficient algorithms for domination problems. For this purpose we consider some particular examples and focus on five graph classes and five well researched variants of the domination problem. Another goal is to present a fairly comprehensive bibliography of algorithms for domination problems. We refer the reader who is unfamiliar with the design and analysis of algorithms to [57].
Bottleneck Domination and Bottleneck Independent Domination on Graphs
, 2002
"... In this paper, the bottleneck dominating set problem and one of its variants, the bottleneck independent dominating set problem, are considered. Let G(V, E, W) denote a graph with nvertexset V and medgeset E, where each vertex v is associated with a real cost W(v). Given any subset V ′ of V, the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In this paper, the bottleneck dominating set problem and one of its variants, the bottleneck independent dominating set problem, are considered. Let G(V, E, W) denote a graph with nvertexset V and medgeset E, where each vertex v is associated with a real cost W(v). Given any subset V ′ of V, the bottleneck cost of V ′ is defined as max{W(x) ⏐ x ∈ V′}. The major task involves identifying a dominating set / independent dominating set of G such that their bottleneck costs are minimized. This paper first proposes an O(nlogn + m) time algorithm for solving the Bottleneck Dominating Set problem on weighted general graphs using the binary search technique. Second, an O(n) time algorithm is designed for the problem on weighted trees. Then, we show that the situation is greatly different when the Bottleneck Independent Dominating Set problem (the BIDS problem) is considered. This paper proves that the BIDS problem is NPhard on planar graphs and presents a lineartime optimal algorithm for the BIDS problem on weighted interval graphs.
Steiner trees and Polyhedra
, 1998
"... this paper, we study polyhedra STP(G,S) and CON(G,S). We describe a new class of facet defining inequalities for the STP(G,S) that generalizes the families of constraints so called Steiner partition inequalities and odd hole inequalities introduced by Chopra and Rao [3]. We show that these inequalit ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
this paper, we study polyhedra STP(G,S) and CON(G,S). We describe a new class of facet defining inequalities for the STP(G,S) that generalizes the families of constraints so called Steiner partition inequalities and odd hole inequalities introduced by Chopra and Rao [3]. We show that these inequalities may define facets for 2trees, which invalidates a conjecture of Chopra and Rao [4]. We also discuss the closely related Steiner connected subgraph polytope. We describe some procedures of construction of facets from facets for CON(G,S). Using this, we obtain a complete description of both CON(G,S) and STP(G,S) for a special case of seriesparallel graphs. Computational applications are also discussed. 2 Valid inequalities
Approximation Algorithms for Connected Dominating Sets
, 1998
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set. We focus on the related question of finding a connected dominating set of minim ..."
Abstract
 Add to MetaCart
(Show Context)
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set. We focus on the related question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of 2H(�) + 2 and H(�) + 2 are presented, where � is the maximum degree and H is the harmonic function. This question also arises in relation to the traveling tourist problem, where one is looking for the shortest tour such that each vertex is either visited or has at least one of its neighbors visited. We also consider a generalization of the problem to the weighted case, and give an algorithm with an approximation factor of (cn + 1) ln n where cn ln k is the approximation factor for the node weighted Steiner tree problem (currently cn = 1.6103). We also consider the more general problem of finding a connected dominating set of a specified subset of vertices and provide a polynomial time algorithm with a (c + 1)H(�) + c − 1 approximation factor, where c is the Steiner approximation ratio for graphs (currently c = 1.644).