Toshihiro Fujito  Home/Search
Context Related
| ieice.org/2000/files/...e83d_3_480.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ieice.org/2000/files/e000d03 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction We start with the set cover( SC ) problem. Given a finite set M and a family N of subsets of M , a subfamily S of N is called a set cover if every element of M appears in some subset in S; in other words, the union of all subsets in S coincides with M . Each set in N is associated with a (U"C2T0"'# e) cost, and the cost of a family is the sum of costs of subsets in it. The set cover problem then asks to find a minimum cost set cover. As a special case when all the costs... (Update)
Context of citations to this paper: More
...of the greedy algorithm for spanning sets in k polymatroids and for k MSS is best possible for large k. See also Fujito s survey article [6] for a related LP based dual greedy algorithm with an incomparable performance ratio. In the next section, polymatroids and the spanning...
Cited by: More
The View Selection Problem for XML Content Based Routing - Gupta, Suciu, Halevy (2003) (Correct)
Approximating Minimum Spanning Sets in Hypergraphs.. - Baudis, Gröpl.. (2000) (Correct)
Active bibliography (related documents): More All
0.8: A Primal-Dual Approach to Approximation of Node-Deletion Problems .. - Fujito (1997) (Correct)
0.6: Approximation Algorithms for Partial Covering Problems - Gandhi, Khuller, Srinivasan (2001) (Correct)
0.5: The Primal-Dual Method for Approximation Algorithms - Williamson (Correct)
Similar documents based on text: More All
0.5: A Polynomial Cycle Canceling Algorithm for Submodular Flows - Wallacher, Zimmermann (1997) (Correct)
0.4: A Combinatorial, Strongly Polynomial-Time Algorithm for.. - Iwata, Fleischer, al. (2001) (Correct)
0.4: An algebraic framework for the greedy algorithm with.. - Faigle, Kern (1998) (Correct)
BibTeX entry: (Update)
Toshihiro Fujito. Approximation algorithms for submodular set cover with applications. IEICE Trans. Inf. Syst, E83-D(3):480--487, 2000. http://search.ieice.or.jp/. http://citeseer.ist.psu.edu/article/fujito00approximation.html More
@article{ fujito00approximation,
author = "Fujito",
title = "Approximation Algorithms for Submodular Set Cover with Applications",
journal = "TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems",
year = "2000",
url = "citeseer.ist.psu.edu/article/fujito00approximation.html" }
Citations (may not include all citations):773 Reducibility among combinatorial problems (context) - Karp - 1972
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
158 Matroid Theory (context) - Welsh - 1976
139 A greedy heuristic for the set-covering problem (context) - Chvatal - 1979
117 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Lovasz et al. - 1988
95 A sub constant error probability low degree test, and a sub .. - Raz, Safra - 1995
75 Approximation algorithms for the set covering and vertex cov.. (context) - Hochbaum - 1982
74 the ratio of optimal integral and fractional covers (context) - Lovasz - 1975
52 The Computational Complexity of Machine Learning (context) - Kearns - 1990
52 A local-ratio theorem for approximating the weighted vertex .. (context) - Bar-Yehuda, Even - 1985
42 Submodular functions and optimization (context) - Fujishige - 1991
40 The approximation of maximum subgraph problems (context) - Lund, Yannakakis - 1993
34 Ramsey numbers and an approximation algorithm for the vertex.. (context) - Monien, Speckenmeyer - 1985
30 A threshold of ln n for approximating set cover - Feige - 1996
25 The node-deletion problem for hereditary properties is NP-co.. (context) - Lewis, Yannakakis - 1980
17 An analysis of approximations for maximizing submodular set .. (context) - Nemhauser, Wolsey et al. - 1978
16 Submodular functions, matroids, and certain polyhedra (context) - Edmonds - 1970
15 Submodular functions and convexity (context) - Lovasz - 1983
12 Worst-case analysis of greedy heuristics for integer program.. (context) - Dobson - 1982
9 A note on independence functions (context) - Rado - 1957
9 Geometric methods in combinatorial optimization (context) - Grotschel, Lovasz et al. - 1984
7 An analysis of the greedy algorithm for the submodular set c.. (context) - Wolsey - 1982
6 Matroid Theory and its Applications (context) - Recski - 1989
6 Maximizing submodular set functions: Formulations and analys.. (context) - Nemhauser, Wolsey - 1981
5 Some optimal in-approximability results (context) - Hastad - 1997
5 A combinatorial algorithm for minimizing symmetric submodula.. - Queyranne - 1995
4 A note on minimizing submodular functions - Nagamochi, Ibaraki - 1998
4 Using homogeneous weights for approximating the partial cove.. (context) - Bar-Yehuda - 1999
3 Massaging a linear programming solution to give a 2-approxim.. - Bshouty, Burroughs - 1998
2 A unified local ratio approximation of nodedeletion problems - Fujito - 1996
2 Approximating node-deletion problems for matroidal propertie.. (context) - Fujito - 1999
1 Improved performance of the greedy algorithm for partial cov.. (context) - Slavk - 1997
1 The t-vertex cover problem: Extending the half integrality f.. (context) - Hochbaum - 1998
Documents on the same site (http://search.ieice.org/2000/files/e000d03.htm): More
Algorithms in Discrete Convex Analysis - Murota (2000) (Correct)
The Linear Complementarity Problem on Oriented Matroids - Tamura (2000) (Correct)
Effective Use of Geometric Information for Clustering and Related.. - Asano (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC