S. O. Krumke, M. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz  Home/Search
Context Related
| zib.de/krumke/Post...tcs_cocoon95.ps.gz info1.informatik.u...tcs_cocoon95.ps.gz info1.informatik.u...tcs_cocoon95.ps.gz Cached: 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.
PS.gz PS Image Update HelpFrom: zib.de/krumke/publications (more) From: info1.informatik.u...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of placing a specified number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a number of problems arising in facility location, statistical clustering, pattern recognition, and also processor allocation problems in multiprocessor systems. We consider the problem under three different objectives, namely minimizing the diameter, minimizing the average distance, and minimizing the... (Update)
Context of citations to this paper: More
.... independent set problem can be reduced to it) the geometric version of this problem has been studied in [1] and the graph version in [11]. 3 Lower bounds An important issue in the design of approximation algorithms for optimization problems is that of the bounding technique...
...compact location problems under the three objectives, namely minimum diameter, minimum average distance and minimum variance. In [KM 96] we present problem instances to show that a solution which is optimal with respect to one objective can be arbitrarily poor with...
Cited by: More
On the Approximability of Location and Network Design Problems - Krumke (1996) (Correct)
Compact Location Problems - Krumke, Marathe, Noltemeier.. (1996) (Correct)
An O(log k)-approximation algorithm for the k minimum.. - Garg, Hochbaum (1994) (Correct)
Active bibliography (related documents): More All
1.0: Bicriteria Compact Location Problems - Krumke, Noltemeier, Ravi, Marathe (1995) (Correct)
1.0: Complexity and Approximability of Certain Bicriteria .. - Krumke, Noltemeier, .. (Correct)
0.6: Compact Location Problems with Budget and.. - Krumke, Noltemeier.. (1995) (Correct)
Similar documents based on text: More All
0.2: Approximation Algorithms for Certain Network Improvement Problems - al. (1998) (Correct)
0.2: Modifying Edges of a Network to Obtain Short Subgroups - Drangmeister, Krumke.. (1996) (Correct)
0.2: Compact Location Problems (Extended Abstract) - Radhakrishnan, Krumke.. (Correct)
Related documents from co-citation: More All
8: Bicriteria Network Design Problems - Marathe, Ravi et al. - 1995
7: points with Minimum Diameter and Related Problems (context) - Aggarwal, Imai et al. - 1991
6: Clustering to minimize the maximum inter-cluster distance (context) - Gonzalez - 1985
BibTeX entry: (Update)
V. Radhakrishnan, S. O. Krumke, M. V. Marathe, D. J. Rosenkrantz and S. S. Ravi, Compact Location Problems. In Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science (FST&TCS'93), Volume 761 of LNCS, pages 238--247, December 1993. http://citeseer.ist.psu.edu/article/krumke97compact.html More
@article{ krumke97compact,
author = "S. O. Krumke and M. V. Marathe and H. Noltemeier and V. Radhakrishnan and S. S. Ravi and D. J. Rosenkrantz",
title = "Compact location problems",
journal = "Theoretical Computer Science",
volume = "181",
number = "2",
pages = "379--404",
year = "1997",
url = "citeseer.ist.psu.edu/article/krumke97compact.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
227 Parallel merge sort (context) - Cole - 1988
185 Applying parallel computation algorithms in the design of se.. (context) - Megiddo - 1983
151 Algorithms and Applications (context) - Ahuja, Magnanti et al. - 1993
108 Improved Non--Approximability Results - Bellare, Sudan - 1994
94 Clustering to Minimize the Maximum Intercluster Distance (context) - Gonzalez - 1985
67 Optimal Algorithms for Approximate Clustering (context) - Feder, Greene - 1988
65 Discrete Location Theory (context) - Mirchandani, Francis - 1990
52 An Analysis of Several Heuristics for the Traveling Salesman.. (context) - Rosenkrantz, Stearns - 1977
50 Approximations with Minimum Packing Constraint Violation (context) - Lin, Vitter - 1992
50 Approximation Algorithms for Geometric Problems - Bern, Eppstein - 1995
47 Bicriteria Network Design Problems - Marathe, Ravi et al. - 1995
44 Many birds with one stone: Multi-objective approximation alg.. - Ravi, Marathe et al. - 1993
44 Static and dynamic algorithms for k-point clustering problem.. (context) - Datta, Lenhof et al. - 1993
43 Improved approximation guarantees for minimum-weight k-trees.. - Awerbuch, Azar et al.
43 Iterated nearest neighbors and finding minimal polytopes - Erickson, Eppstein - 1994
40 A Unified Approach to Approximation Algorithms for Bottlenec.. (context) - Hochbaum, Shmoys - 1986
36 Spanning trees short or small - Ravi, Sundaram et al.
33 Minimum Spanning Tree Problem in the Plane (context) - Garg, Hochbaum et al. - 1994
33 A Constant-Factor Approximation for the k-MST Problem in the.. (context) - Blum, Chalasani et al.
32 On choosing a dense subgraph (context) - Kortsarz, Peleg - 1993
29 nearest neighbor Voronoi diagrams in the plane (context) - Lee, k- - 1982
27 points with Minimum Diameter and Related Problems (context) - Aggarwal, Imai et al. - 1991
20 Introduction to Mathematical Techniques in Pattern Recogniti.. (context) - Andrews - 1972
20 Heuristic and Special Case Algorithms for Dispersion Problem.. (context) - Ravi, Rosenkrantz et al. - 1994
19 How to Allocate Network Centers (context) - Bar-Ilan, Kortsarz et al. - 1993
19 Location on Networks: Theory and Algorithms (context) - Handler, Mirchandani - 1979
16 Analytical Models for Locating Undesirable Facilities (context) - Erkut, Neuman - 1989
16 Obnoxious Facility Location on Graphs (context) - Tamir - 1991
15 Minimal and bounded trees (context) - Zelikowsky, Lozevanu - 1993
14 Operations Research Letters (context) - Dyer, Frieze et al. - 1985
8 Compact Location Problems - Radhakrishnan, Krumke et al. - 1993
6 Scheduling unrelated parallel machines with costs (context) - Shmoys, Tardos - 1993
4 Compact Location Problems with Budget and Communication Cons.. - Krumke, Noltemeier et al. - 1995
2 Bicriteria Problems in Location Theory (context) - Krumke, Noltemeier et al. - 1995
1 Capacitated Versions of Dispersion Problems (context) - Rosenkrantz, Ravi et al. - 1995
1 Bicriteria Compact Location Problems for Trees (context) - Krumke, Noltemeier et al. - 1995
1 Rosenkrantz Compact Location Problems Technical Report LA-UR (context) - Krumke, Marathe et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zib.de/krumke/publications.html): More
Complexity and Approximability of Certain Bicriteria .. - Krumke, Noltemeier, .. (Correct)
Compact Location Problems (Extended Abstract) - Radhakrishnan, Krumke.. (Correct)
Bicriteria Compact Location Problems - Krumke, Noltemeier, Ravi, Marathe (1995) (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