3D Modeling and Rendering White Papers

Approximations of Weighted Independent Set and Hereditary Subset Problems

Overview The focus of this study is to clarify the approximability of weighted versions of the maximum independent set problem. In particular, we report improved performance ratios in bounded-degree graphs, inductive graphs, and general graphs, as well as for the unweighted problem in sparse graphs. Where possible, the techniques are applied to related hereditary subgraph and subset problem, obtaining ratios better than previously reported for e.g. Weighted Set Packing, Longest Common Subsequence, and Independent Set in hypergraphs.

Further White Paper Details
PublisherBrown University File FormatPDF, requires Acrobat Rdr 5
Date PublishedApril 2000 Downloads24
FormatWhite Papers   
Topics
Thin clients switch on digitally excluded

Thin clients switch on digitally excluded

Case study: Digital inclusion project tackles social exclusion in Liverpool more

Renault goes multilingual

Renault goes multilingual

Case study: Translation tech turns docs into 23 languages… more


Quick Sitemap Links: