Approximating the Degree-Bounded k-Set Packing Problem
نویسندگان
چکیده
Halldórsson (1995) claimed a (k + 1)/3 + 2 performance ratio for approximating the degree-bounded k-set packing problem. However, its detailed proof was omitted therein. In this report, we attempt to present in detail the proof toward this performance ratio which was briefly given in Halldórsson and Radhakrishnan (1994), and further show that the underlying local improvement search algorithm runs in time n −2.6k2 log .
منابع مشابه
On the Hardness of Approximating k-Dimensional Matching
We study bounded degree graph problems, mainly the problem of k-Dimensional Matching (k-DM), namely, the problem of finding a maximal matching in a k-partite k-uniform balanced hyper-graph. We prove that k-DM cannot be efficiently approximated to within a factor of O( k ln k ) unless P = NP . This improves the previous factor of k 2O( √ ln ) by Trevisan [Tre01]. For low k values we prove NP-har...
متن کاملApproximating Upper Degree-Constrained Partial Orientations
In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph G = (V,E), together with two degree constraint functions d−, d : V → N. The goal is to orient as many edges as possible, in such a way that for each vertex v ∈ V the number of arcs entering v is at most d−(v), whereas the number of arcs leaving v is at most d(v). This problem was introduced by Gabow [SO...
متن کاملPartial degree bounded edge packing problem for graphs and k-uniform hypergraphs
Given a graph G = (V,E) and a non-negative integer cu for each u ∈ V , Partial Degree Bounded Edge Packing (PDBEP) problem is to find a subgraph G′ = (V,E′) with maximum |E′| such that for each edge (u, v) ∈ E′, either degG′(u) ≤ cu or degG′(v) ≤ cv. The problem has been shown to be NPhard even for uniform degree constraint (i.e., all cu being equal). In this work we study the general degree co...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملبررسی تعدادی از روشهای آماری جهت ترسیم نمودار کنترل مشاهدات انفرادی برای فرایندهای اتورگرسیو
Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fu...
متن کامل