[PDF] Top 20 Approximation Algorithms for Covering and Packing Problems on Paths

... Bar-Noy et al. studied the full cover version where all the jobs have to be covered. They gave a 4-approximation algorithm for this problem. Chakaravarthy et al. considers a scenario, where the timeslots have ... See full document

... design problems with element and vertex connectivity requirements is whether we can simultaneously achieve a constant factor approximation in both the weight of the solution and the violation on the ... See full document

... improved approximation algorithm for the Covering Steiner ...for covering problems: its approximability cannot get better as the covering requirements ...the approximation ratio ... See full document

... in algorithms for discrete optimization problems with current research focussing on ap- proximation ...world problems at Bell Labs and appreciates the difficulty in finding the right balance between ... See full document

... Such results for the reoptimization of discrete optimi- zation problems are known. When an elementary dis- junction is inserted reoptimization of Max Weighted Sat (weighted satisfiability problem for maximum) ... See full document

... the problems we consider, even in their simplest form, are ...our algorithms proceed by adopting and extending known polynomial-time approximation schemes for the off- line versions of the ... See full document

... identify paths connecting each Steiner vertex to some terminal in such a way that the paths do not overlap ...these paths in the second part, so that the total weight of the selected paths is ... See full document

... of packing linear programs ...online algorithms for this problem, as well as an optimal deterministic online algorithm for the special case of linear programs involving two ... See full document

... If some k-edges send k/2 units of flow to two vertices, build a bipartite graph G 00 with edge nodes corresponding to the k-edges sending exactly k/2 units of flow to two vertices on one side and vertex nodes receiving ... See full document

... k paths-orientation ...two problems. They showed that, for unrestricted k, the min-sum k-paths orientation problem does not have a polynomial time algorithm with an approximation factor of 2 ... See full document

... The Unique Games Conjecture has been shown to imply several inapproximability results, such as that the minimum edge-deletion bipartite subgraph problem is hard to approximate within any constant factor [11], that the ... See full document

... Our system detects simple duplicates (those with an empty diff) directly, as they carry equal fingerprints or hash-values. However there are also duplicates, like isomorphic problems through variable renaming and ... See full document

... ²) approximation, we need only show that quantizing the optimal conditional distribution on the source given the auxiliary random variable would yield performance within a factor (1 + ²) of the ... See full document

... set covering situations where a reasonable cover is given in ...set covering problem has been solved either by means of an exact algorithm or by a heuristic or, the agents have simply reached an agreement ... See full document

... Maximum packing densities can easily be simulated by the SPACE ...aggregate packing problems on engineering level, or for binder particle packing problems particularly at low water to ... See full document

... many problems, a greedy strategy does not in general produce an optimal solution, but nonetheless a greedy heuristic may yield locally optimal solutions that approximate a global optimal solution in a reasonable ... See full document

... The AP data set was first used by Ernst and Krishnamoorthy (1996) and is arranged accord- ing to postal delivery in Sydney, Australia. It consists of 200 nodes that represent the postal districts. This data set features ... See full document

... become necessary to solve the OPF problem in each hour considering economic and security aspects and is termed as dynamic optimal power flow (DOPF). The DOPF is actually the extended formulations of the original OPF ... See full document

... resulting packing render optimization heuristic and metaheuristic algorithms applied for generation placement ...of packing formation by a given placement string are defined by used packing ... See full document

... The 3-partitioning problem is to decide whether a given multiset of nonnegative integers can be partitioned into triples that all have the same sum. It is considerably used to prove the strong NP-hardness of many ... See full document