共查询到20条相似文献,搜索用时 0 毫秒
1.
In the group Steiner problem we are given an edge-weighted graph G=(V,E,w) and m subsets of vertices . Each subset gi is called a group and the vertices in ?igi are called terminals. It is required to find a minimum weight tree that contains at least one terminal from every group.We present a poly-logarithmic ratio approximation for this problem when the input graph is a tree. Our algorithm is a recursive greedy algorithm adapted from the greedy algorithm for the directed Steiner tree problem [Approximating the weight of shallow Steiner trees, Discrete Appl. Math. 93 (1999) 265-285, Approximation algorithms for directed Steiner problems, J. Algorithms 33 (1999) 73-91]. This is in contrast to earlier algorithms that are based on rounding a linear programming based relaxation for the problem [A polylogarithmic approximation algorithm for the Group Steiner tree problem, J. Algorithms 37 (2000) 66-84, preliminary version in Proceedings of SODA, 1998 pp. 253-259, On directed Steiner trees, Proceedings of SODA, 2002, pp. 59-63]. We answer in positive a question posed in [A polylogarithmic approximation algorithm for the Group Steiner tree problem, J. Algorithms 37 (2000) 66-84, preliminary version in Proceedings of SODA, 1998 pp. 253-259] on whether there exist good approximation algorithms for the group Steiner problem that are not based on rounding linear programs. For every fixed constant ε>0, our algorithm gives an approximation in polynomial time. Approximation algorithms for trees can be extended to arbitrary undirected graphs by probabilistically approximating the graph by a tree. This results in an additional multiplicative factor of in the approximation ratio, where |V| is the number of vertices in the graph. The approximation ratio of our algorithm on trees is slightly worse than the ratio of O(log(maxi|gi|)·logm) provided by the LP based approaches. 相似文献
2.
We provide a characterization of the cases when the greedy algorithm may produce the unique worst possible solution for the problem of finding a minimum weight base in an independence system when the weights are taken from a finite range. We apply this theorem to TSP and the minimum bisection problem. The practical message of this paper is that the greedy algorithm should be used with great care, since for many optimization problems its usage seems impractical even for generating a starting solution (that will be improved by a local search or another heuristic). 相似文献
3.
A. Warburton 《Mathematical Programming》1985,33(2):234-241
Min-max problems on matroids are NP-hard for a wide variety of matroids. However, greedy type algorithms have data independent worst case performance guarantees, andn-enumerative algorithms yield-optimal solutions ifn is sufficiently close to the rank of the underlying matroid. Data dependent performance guarantees can be obtained for max-min problems over matroids.This research was partially supported by NSERC Grant A5543. 相似文献
4.
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm 总被引:1,自引:0,他引:1
In contrast to linear schemes, nonlinear approximation techniques allow for dimension independent rates of convergence. Unfortunately, typical algorithms (such as, e.g., backpropagation) are not only computationally demanding, but also unstable in the presence of data noise. While we can show stability for a weak relaxed greedy algorithm, the resulting method has the drawback that it requires in practise unavailable smoothness information about the data.In this work we propose an adaptive greedy algorithm which does not need this information but rather recovers it iteratively from the available data. We show that the generated approximations are always at least as smooth as the original function and that the algorithm also remains stable, when it is applied to noisy data. Finally, the applicability of this algorithm is demonstrated by numerical experiments. 相似文献
5.
David R. Karger 《Mathematical Programming》1998,82(1-2):41-81
Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the effectiveness of these paradigms for two optimization problems on matroids: finding an optimum matroid basis and packing disjoint matroid bases. Application of these ideas to the graphic matroid led to fast algorithms for minimum spanning trees and minimum cuts. An optimum matroid basis is typically found by agreedy algorithm that grows an independent set into an optimum basis one element at a time. This continuous change in the independent set can make it hard to perform the independence tests needed by the greedy algorithm. We simplify matters by using sampling to reduce the problem of finding an optimum matroid basis to the problem of verifying that a givenfixed basis is optimum, showing that the two problems can be solved in roughly the same time. Another application of sampling is to packing matroid bases, also known as matroid partitioning. Sampling reduces the number of bases that must be packed. We combine sampling with a greedy packing strategy that reduces the size of the matroid. Together, these techniques give accelerated packing algorithms. We give particular attention to the problem of packing spanning trees in graphs, which has applications in network reliability analysis. Our results can be seen as generalizing certain results from random graph theory. The techniques have also been effective for other packing problems. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Some of this work done at Stanford University, supported by National Science Foundation and Hertz Foundation Graduate Fellowships, and NSF Young Investigator Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation and Xerox Corporation. Also supported by NSF award 962-4239. 相似文献
6.
Colin McDiarmid 《Mathematical Programming》1986,36(3):245-255
We consider hereditary systems (such as matroids) where the underlying elements have independent random costs, and investigate
the cost of the base picked by the greedy algorithm. 相似文献
7.
Greedy algorithms for combinatorial optimization problems are typically direct and efficient, but hard to prove optimality.
The paper presents a special class of transportation problems where a supplier sends goods to a set of customers, returning
to the source after each delivery. We show that these problems with different objective functions share a common structural
property, and therefore a simple but powerful generic greedy algorithm yields optimal solutions for all of them. 相似文献
8.
The set cover problem is that of computing a minimum weight subfamily F′, given a family F of weighted subsets of a base set U, such that every element of U is covered by some subset in F′. The k-set cover problem is a variant in which every subset is of size at most k. It has been long known that the problem can be approximated within a factor of by the greedy heuristic, but no better bound has been shown except for the case of unweighted subsets. In this paper we consider approximation of a restricted version of the weighted 3-set cover problem, as a first step towards better approximation of general k-set cover problem, where any two distinct subset costs differ by a multiplicative factor of at least 2. It will be shown, via LP duality, that an improved approximation bound of H(3)-1/6 can be attained, when the greedy heuristic is suitably modified for this case. A key to our algorithm design and analysis is the Gallai-Edmonds structure theorem for maximum matchings. 相似文献
9.
A polynomial-time algorithm for the change-making problem 总被引:1,自引:0,他引:1
David Pearson 《Operations Research Letters》2005,33(3):231-234
Optimally making change—representing a given value with the fewest coins from a set of denominations—is in general NP-hard. In most real money systems however, the greedy algorithm is optimal. We give a polynomial-time algorithm to determine, for a given coin system, whether the greedy algorithm is optimal. 相似文献
10.
We study a two-phase, budget-constrained, network-planning problem with multiple hub types and demand scenarios. In each phase, we install (or move) capacitated hubs on selected buildings. We allocate hubs to realized demands, under technological constraints. We present a greedy algorithm to maximize expected demand covered and computationally study its performance. 相似文献
11.
《Operations Research Letters》2014,42(5):319-324
We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment and develop a simple and fast greedy algorithm that iteratively removes at most one product from each nest to compute an optimal solution. 相似文献
12.
E. Angelelli R. Mansini M. Vindigni 《Central European Journal of Operations Research》2009,17(2):141-158
Given a set of products and a set of markets, the traveling purchaser problem looks for a tour visiting a subset of the markets
to satisfy products demand at the minimum purchasing and traveling costs. In this paper, we analyze the dynamic variant of
the problem (D-TPP) where the quantity made available in each market for each product may decrease over time. We introduce
and compare several greedy strategies and test their impact on the solution in terms of feasibility and costs. In particular,
we study an incremental approach where an initial naive strategy is improved and refined by a number of variants. Some of
the proposed heuristics take into account either one of the two objective costs, while others are based on both traveling
and purchasing costs. Extensive computational results are also provided on randomly generated instances. 相似文献
13.
G. Amirkhanyan 《Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences)》2008,43(4):206-213
The paper studies convergence of the greedy algorithm by the Walsh system in the space C(0, 1). Some sufficient conditions for uniform convergence are given. It is proved that there exists a function satisfying more restrictive conditions, for which the sequence of the partial sums of the Fourier-Walsh series diverges at the point 0. 相似文献
14.
The constrained forest problem seeks a minimum-weight spanning forest in an undirected edge-weighted graph such that each tree spans at least a specified number of vertices. We present a greedy heuristic for this NP-hard problem, whose solutions are at least as good as, and often better than, those produced by the best-known 2-approximate heuristic. 相似文献
15.
Masataka Nakamura 《Operations Research Letters》2005,33(4):389-394
A polygreedoid and a poly-antimatroid are the generalization of a greedoid and an antimatroid, respectively, obtained by allowing a word to include repeated elements. We shall describe the algorithmic characterizations of a polygreedoid and of a poly-antimatroid based on bottleneck types of greedy algorithms. A notion of score space is investigated for further study of poly-antimatroids. 相似文献
16.
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and the Orthogonal Greedy Algorithm in terms of the best m-term approximations. We call such estimates the Lebesgue-type inequalities. We prove the Lebesgue-type inequalities for dictionaries with special structure. We assume that the dictionary has a property of mutual incoherence (the coherence parameter of the dictionary is small). We develop a new technique that, in particular, allowed us to get rid of an extra factor m1/2 in the Lebesgue-type inequality for the Orthogonal Greedy Algorithm. 相似文献
17.
18.
Given a set ofn positive integers and another positive integerW, the Subset-Sum Problem is to find that subset whose sum is closest to, without exceeding,W. We present a polynomial approximation scheme for this problem and prove that its worst-case performance dominates that of
Johnson's well-known scheme.
Research supported by Ministero Pubblica Istruzion, Italy. 相似文献
19.
A new heuristic procedure, which is called Smart Greedy, is proposed for solving a kind of general reliability optimization problems (non-DGR type knapsack problems). Smart Greedy uses Recursive Greedy with multiple greedy functions designated by balance coefficients, generates several solutions and then determines the best solution among them as the smart greedy solution. Recursive Greedy first checks the feasibility of sets of items for a given problem and removes infeasible items from the item sets. Second, the procedure checks the gain ratio of increments of objective function to constraint function and reduces the problem to DGR type problem by invoking LP dominance. Third, the procedure continues to allocate the increments for current items until the constraint is violated. With the current solution, the procedure then repeats the greedy procedure for current items that are added to the items removed by the LP dominance in the previous step.Computational results show that the Smart Greedy is more effective than the previously reported methods. 相似文献
20.
The single-sink fixed-charge transportation problem (SSFCTP) consists of finding a minimum cost flow from a number of nodes
to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is
an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving
this problem have been proposed in the literature. In this paper, some greedy heuristic solutions methods for the SSFCTP are
investigated. It is shown that two greedy approaches for the SSFCTP known from the literature can be arbitrarily bad, whereas
an approximation algorithm proposed in the literature for the binary min-knapsack problem has a guaranteed worst case bound
if adapted accordingly to the case of the SSFCTP. 相似文献