A 3/4-Approximation Algorithm for Multiple Subset Sum by Ageev A.A., Baburin A.E., Gimandi E.K.

By Ageev A.A., Baburin A.E., Gimandi E.K.

Show description

Read or Download A 3/4-Approximation Algorithm for Multiple Subset Sum PDF

Best algorithms and data structures books

Adaptive filtering: algorithms and practical implementation

This ebook provides a finished evaluate of either the basics of wavelet research and comparable instruments, and of the main lively fresh advancements in the direction of functions. It bargains a cutting-edge in numerous lively components of analysis the place wavelet principles, or extra mostly multiresolution rules have proved fairly potent.

Fundamentals of Algebraic Specification 2: Module Specifications and Constraints

Because the early seventies thoughts of specification became vital within the complete zone of computing device technology. particularly algebraic specification ideas for summary information kinds and software program structures have won significant value in recent times. they've got not just performed a primary function within the idea of knowledge sort specification, yet in the meantime have had a striking impression on programming language layout, procedure architectures, arid software program instruments and environments.

Simple Program Design: A Step-by-Step Approach

Uncomplicated software layout: A step-by-step technique, 5th version is written for programmers who are looking to improve reliable programming abilities for fixing universal enterprise difficulties. The 5th version has been completely revised in response to smooth software layout options. The easy-to-follow tutorial variety has been retained besides the language-independent method of application layout.

Additional resources for A 3/4-Approximation Algorithm for Multiple Subset Sum

Example text

3 1 2 3 The density of a subgraph with k vertices is the fraction of the k(k − 1)/2 possible edges that exist in the subgraph. A more careful implementation, using a bucket-based priority queue, gives complexity O(n log n). , take a collection of m k-cliques and connect them via m additional edges. All nodes have a degree of k or k + 1 so the core is the whole graph. As m grows the density vanishes. Finding a Dense-Core in Jellyfish Graphs 31 Subramanian et al. [32] suggested a 5-tier hierarchical layering of the AS-graph.

Return C, H Our main result is the following: Theorem 2. Let G = (V, E) be a sparse graph that contains a (k, Ω(n1−β ), O(n1−β/2 ), c, )-Jellyfish subgraph. t. 5 For k = O(log n) and β ≤ 2/5, the time complexity of ˜ 1−β/2 )6 . Algorithm 2 is O(n The proof of Theorem 2 appears in the full version of the paper [20]. 5 Implementation To demonstrate the usefulness of our algorithms beyond their theoretical contribution, we conducted a performance evaluation of our algorithm in comparison with the GreedyMaxClique algorithm of Siganos et al.

Xt−1 .... 1 Introduction During the last decade a large body of research has centered on understanding and modeling the structure of large-scale networks like the Internet and the World Wide Web. Several recent books provide a general introduction to this topic [37] and [40]. , the proportion of vertices of degree at least k is proportional to k −α for some constant α). This has driven the investigation of random graph distributions which generate heavy-tailed degree distributions, including the fixed degree sequence model, the copying model, and the preferential attachment model.

Download PDF sample

Rated 4.04 of 5 – based on 6 votes