Complexity and approximability of certain bicriteria location problems

PDF Version Also Available for Download.

Description

We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a specified number of facilities (i.e. a placement of a specified size) to minimize a function of one distance metric subject to a budget constraint on the other distance metric. Such problems arise in several application areas including statistical clustering, pattern recognition and load-balancing in distributed systems. We show that, in general, obtaining placements that are near-optimal with respect to the first distance metric is NP-hard even when we allow the budget ... continued below

Physical Description

20 p.

Creation Information

Krumke, S.O.; Noltemeier, H.; Ravi, S.S. & Marathe, M.V. October 1, 1995.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Authors

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a specified number of facilities (i.e. a placement of a specified size) to minimize a function of one distance metric subject to a budget constraint on the other distance metric. Such problems arise in several application areas including statistical clustering, pattern recognition and load-balancing in distributed systems. We show that, in general, obtaining placements that are near-optimal with respect to the first distance metric is NP-hard even when we allow the budget constraint on the second distance metric to be violated by a constant factor. However, when both the distance metrics satisfy the triangle inequality, we present approximation algorithms that produce placements which are near-optimal with respect to the first distance metric while violating the budget constraint only by a small constant factor. We also present polynomial algorithms for these problems when the underlying graph is a tree.

Physical Description

20 p.

Notes

OSTI as DE96001382

Source

  • International workshop on graph theoretic concepts, Aachen (Germany), Jan 1996

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE96001382
  • Report No.: LA-UR--95-3349
  • Report No.: CONF-960141--1
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 125167
  • Archival Resource Key: ark:/67531/metadc626386

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • October 1, 1995

Added to The UNT Digital Library

  • June 16, 2015, 7:43 a.m.

Description Last Updated

  • March 2, 2016, 1:05 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 2

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Krumke, S.O.; Noltemeier, H.; Ravi, S.S. & Marathe, M.V. Complexity and approximability of certain bicriteria location problems, article, October 1, 1995; New Mexico. (digital.library.unt.edu/ark:/67531/metadc626386/: accessed December 17, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.