ALGORITHMICA 1998

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ALGORITHMICA-1998 Paper

click to vote

ALGORITHMICA
1998

184views more ALGORITHMICA 1998»

Approximation Algorithms for Connected Dominating Sets

13 years 4 months ago

Download www.cis.upenn.edu

The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...

Sudipto Guha, Samir Khuller

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	184	Approximation Algorithms for Connected Dominating Sets	claim
2	143	On Minimum-Area Hulls	claim
3	118	On the Analysis of Linear Probing Hashing	claim
4	111	A Note on Point Location in Delaunay Triangulations of Random Points	claim
5	103	On Bayes Methods for On-Line Boolean Prediction	claim
6	94	A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs	claim
7	90	Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators	claim
8	81	The List Update Problem: Improved Bounds for the Counter Scheme	claim
9	79	Finding Largest Subtrees and Smallest Supertrees	claim
10	76	On Learning Decision Trees with Large Output Domains	claim
11	75	Average Case Analyses of List Update Algorithms, with Applications to Data Compression	claim
12	73	Linear Probing and Graphs	claim
13	67	On a Kernel-Based Method for Pattern Recognition, Regression, Approximation, and Operator Inversion	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers