E. M. Arkin and M. Hassin. Minimum diameter covering problems. Technical report, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximation Algorithms For Set Cover And Related Problems - Slavík (1998) (Correct)
....algorithms are combinations of greedy strategies and local improvements and do not have a good worst case performance. In fact, one can construct instances where his heuristics perform as badly as Theta(m) A problem somewhat similar to GTSP and Group Steiner is discussed by Arkin and Hassin in [5]. Given the same set up as for GTSP, their goal was to find a subgraph G of G of minimum diameter containing at least one vertex from each cluster. This problem is of course much simpler than Group Steiner and hence their algorithm cannot provide any reasonable approximations to either GTSP or ....
E. M. Arkin and R. Hassin. Minimum diameter covering problems. Submitted, Aug. 1995.
Multiple Sequence Alignment as a Facility Location Problem - Winfried Just And (2000) (Correct)
....: x k of points such that x i 2 R i for 1 i k. The problem asks for a feasible solution that minimizes 1 i j k d(x i ; x j ) While facility location problems with objective functions similar to those of Switchboard Location have been studied for regions of the real line (see e.g. [2], 16] we are not aware of any published results concerning the general formulation of Switchboard Location given above. We will discuss later how instances of Space L Alignment( can be mapped to suitable instances of Switchboard Location in order to have a (1 ) approximation algorithm. ....
....Location 2 problem is MAX SNP hard. In view of our observation that Gap 0 1 Alignment is a special case of Switchboard Location, Theorem 5 is a corollary of Theorem 3(c) of [12] Acknowledgements We thank Tao Jiang for helpful discussions about this paper and Arie Tamir for bringing references [2] and [16] to our attention. ....
E. M. Arkin and M. Hassin. Minimum diameter covering problems. Technical report, 1997.
Upper Bounds for Z-Grid Rectangular Covering Problems - Porschen (2001) (Correct)
....of the rectangles which may represent communication costs for processors associated to the corresponding region. Another applicational eld may be picture processing [12,14] and, closely related, data compression. Of course, besides merely abstract set or graph theoretic covering problems ([1], 11] there are also lots of geometric variants most of them concerning points distributed in the Euclidean plane [3] many of them, as far as dealing with arbitrary many covering components being NP hard [6,9] On the other hand, there are also certain partition or clustering problems [4,5,8] ....
E.M. Arkin, R. Hassin, Minimum-Diameter Covering Problems, Networks 36 (2000) 147-155.
Multiple Sequence Alignment as a Facility Location Problem - Just, Vedova (2000) (Correct)
....x 1 : x k of points such that x i 2 R i for 1 i k. The problem asks for a feasible solution that minimizes P 1i jk d(x i ; x j ) While facility location problems with objective functions similar to those of Switchboard Location have been studied for regions of the real line (see e.g. [AH97], T94] we are not aware of any published results concerning the general formulation of Switchboard Location given above. 4 Multiple Sequence Alignment as a Facility Location Problem We will discuss later how instances of Space L Alignment(oe) can be mapped to suitable instances of Switchboard ....
....Location 2 problem is MAX SNP hard. In view of our observation that Gap 0 1 Alignment is a special case of Switchboard Location, Theorem 5 is a corollary of Theorem 3(c) of [J99] Acknowledgements We thank Tao Jiang for helpful discussions about this paper and Arie Tamir for bringing references [AH97] and [T94] to our attention. ....
E. M. Arkin and M. Hassin. Minimum diameter covering problems. Technical report, 1997.
The Errand Scheduling Problem - Slavik (1997) (1 citation) (Correct)
....as hard to approximate as the set cover problem, which is a rather trivial observation in our formulation of the problem as TCP. Other, quite restricted cases of the group Steiner tree problem are discussed in [24] A problem somewhat similar to ESP and TCP is discussed by Arkin and Hassin in [1]. Given the same set up as for ESP, their goal was to find a subgraph G 0 of G of minimum diameter such that the ground set is covered by subsets corresponding to vertices in G 0 . Unfortunately, their algorithm does not help us to obtain any reasonable approximations to either TCP or ESP. In ....
E.M. Arkin and R. Hassin. Minimum Diameter Covering Problems. Submitted.
Multiple Sequence Alignment and Phylogenetic Reconstruction.. - Vedova (Correct)
No context found.
E. M. Arkin and M. Hassin. Minimum diameter covering problems. Technical report, 1997.
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