Journal of Graph Algorithms and Applications Approximations of Weighted Independent Set and Hereditary Subset Problems
The focus of this study is to clarify the approximability of the important versions of the maximum independent set problem, and to apply, where possible, the technique to related hereditary subgraph and subset problem. We report improved performance ratios for the Independent Set problem in weighted general graphs, weighted bounded-degree graphs, and in sparse graphs. Other problems with better than previously reported ratios include Weighted Set Packing, Longest Subsequence, Maximum Independent Sequence, and Independent Set in hypergraphs.
Heuristics for finding large independent sets, with applications to coloring semi-random graphs
We study a semi-random graph model for finding independent sets. For /spl alpha/>0, an n-vertex graph with an independent set S of site /spl alpha/n is constructed by blending random and adversarial decisions. Randomly and independently with probability p, each pair of vertices, such that one is in S and the other is not, is connected by an edge. An adversary can then add edges arbitrarily (provided that S remains an independent set). The smaller p is, the larger the control the adversary has over the semi-random graph. We design heuristics that with high probability recover S when p>(1+/spl epsiv/)ln n/|S|, for any constant /spl epsiv/>0. We show that when p<(1-/spl epsiv/) In n/|S|, an independent set of size |S| cannot be recovered, unless NP/spl sube/BPP. We use our remits to obtain greatly improved coloring algorithms for the model of k-colorable semi-random graphs introduced by A. Blum and J. Spencer (1995).
information system management system cloud computing decision making information technology world wide web life cycle hidden markov model markov model wide web world wide empirical study sustainable development literature review factors affecting life cycle assessment developing country web server parallel algorithm factors influencing cycle assessment electronic commerce technology acceptance model environmental management protein structure user authentication empirical investigation technology acceptance amino acid independent set cloud computing service integrated model protein sequence protein data bank corporate governance nucleic acid set problem sustainability assessment technology adoption environmental management system mobile commerce environmental sustainability internet banking life cycle costing fast parallel maximum independent set mobile banking electronic busines independent set problem maximum independent maximal independent set business network perceived risk cloud computing adoption maximal independent internet web computing adoption workload characterization adoption model sustainability indicator fast parallel algorithm target prediction sustainability issue life cycle sustainability performance outcome top management support adoption of mobile innovation adoption corporate sustainability system adoption information technology adoption adoption decision influencing the adoption cycle sustainability tam model weighted independent set technology adoption model adoption rate sustainability reporting set packing amino acid substitution adoption behavior weighted independent commerce adoption consumer adoption adoption of internet generalized hidden markov sustainability practice banking adoption weighted set subset problem acid substitution e-business adoption product adoption perceived behavioral control natural capital mirna target prediction electronic commerce adoption mobile banking adoption adoption research toe framework ecological sustainability agricultural sustainability independent sequence internet web server technology adoption research review [publication type] united state