Proceedings ArticleDOI
Improved approximation algorithms for uniform connectivity problems
Samir Khuller,Balaji Raghavachari +1 more
- pp 1-10
Reads0
Chats0
TLDR
The problem of finding minimum weight spanning subgraphs with a given connectivity requirement is considered and polynomial time approximation algorithms for various weighted and unweighed connectivity problems are given.Abstract:
The problem of finding minimum weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighed connectivity problems are given. The following results are presented:read more
Citations
More filters
Book
Approximation Algorithms
TL;DR: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field.
Journal ArticleDOI
Structural cohesion and embeddedness: A hierarchical concept of social groups
James Moody,Douglas R. White +1 more
TL;DR: In this article, structural cohesion is defined as the minimum number of actors who, if removed from a group, would disconnect the group, and a structural dimension of embeddedness can then be defined through the hierarchical nesting of these cohesive structures.
BookDOI
Complexity and Approximation
Giorgio Ausiello,Alberto Marchetti-Spaccamela,Pierluigi Crescenzi,Giorgio Gambosi,Marco Protasi,Viggo Kann +5 more
Journal ArticleDOI
Survey Topology management techniques for tolerating node failures in wireless sensor networks: A survey
TL;DR: This paper focuses on network topology management techniques for tolerating/handling node failures in WSNs and two broad categories based on reactive and proactive methods have been identified for classifying the existing techniques.
Proceedings ArticleDOI
Algorithmic aspects of topology control problems for ad hoc networks
TL;DR: A general approach leading to a polynomial algorithm is presented for minimizing maximum power for a class of graph properties called textbf monotone properties and a new approximation algorithm for the problem of minimizing the total power for obtaining a 2-node-connected graph is obtained.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Proceedings Article
A general approximation technique for constrained forest problems
TL;DR: A 2-approximation algorithm for the Steiner tree problem was given in this paper with running time of O(n 2 log n) for the shortest path problem, where n is the number of vertices in a graph.