V. Radhakrishnan, S.O. Krumke, M.V. Marathe, D.J. Rosenkrantz, S. S. Ravi  Home/Search
Context
Related
| zib.de/krumke/Postscrip...fstcs93.ps.gz info1.informatik.uniwu...fstcs93.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: ) V. Radhakrishnan S.O. Krumke y M.V. Marathe D.J. Rosenkrantz S. S. Ravi Department of Computer Science University at Albany -- SUNY Albany, NY 12222 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 a processor allocation problem in... (Update)
Similar documents based on text: More All
0.2: Approximation Algorithms for PSPACE-Hard.. - Marathe, III.. (1998) (Correct)
0.2: Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997) (Correct)
0.2: NC-Approximation Schemes for NP- and PSPACE-Hard.. - Hunt, III.. (1997) (Correct)
BibTeX entry: (Update)
@misc{ radhakrishnan-compact,
author = "V. Radhakrishnan and S.O. Krumke and M.V. Marathe and D.J. Rosenkrantz
and S. S. Ravi",
title = "Compact Location Problems (Extended Abstract)",
url = "citeseer.ist.psu.edu/43711.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
295 Clustering Algorithms (context) - Hartigan - 1975
135 An Introduction to Parallel Algorithms (context) - JaJa - 1992
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
40 A Unified Approach to ApproximationAlgorithms for Bottleneck.. (context) - Hochbaum, Shmoys - 1986
39 ffl-approximations with minimum packing constraint violation (context) - Lin, Vitter - 1992
20 A Simple Heuristic for the p-Center Problem (context) - Dyer, Frieze - 1985
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. - 1991
19 Location on Networks: Theory and Algorithms (context) - Handler, Mirchandani - 1979
[Article contains additional citations not shown here]
Documents on the same site (http://www.zib.de/krumke/publications.html): More
Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997) (Correct)
Complexity and Approximability of Certain Bicriteria .. - Krumke, Noltemeier, .. (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