Compact location problems with budget and communication constraints

PDF Version Also Available for Download.

Description

The authors consider the problem of placing a specified number p of facilities on the nodes of a given network with two nonnegative edge-weight functions so as to minimize the diameter of the placement with respect to the first weight function subject to a diameter or sum-constraint with respect to the second weight function. Define an ({alpha}, {beta})-approximation algorithm as a polynomial-time algorithm that produces a solution within {alpha} times the optimal value with respect to the first weight function, violating the constraint with respect to the second weight function by a factor of at most {beta}. They show that ... continued below

Physical Description

12 p.

Creation Information

Krumke, S.O.; Noltemeier, H.; Ravi, S.S. & Marathe, M.V. July 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

The authors consider the problem of placing a specified number p of facilities on the nodes of a given network with two nonnegative edge-weight functions so as to minimize the diameter of the placement with respect to the first weight function subject to a diameter or sum-constraint with respect to the second weight function. Define an ({alpha}, {beta})-approximation algorithm as a polynomial-time algorithm that produces a solution within {alpha} times the optimal value with respect to the first weight function, violating the constraint with respect to the second weight function by a factor of at most {beta}. They show that in general obtaining an ({alpha}, {beta})-approximation for any fixed {alpha}, {beta} {ge} 1 is NP-hard for any of these problems. They also present efficient approximation algorithms for several of the problems studied, when both edge-weight functions obey the triangle inequality.

Physical Description

12 p.

Notes

OSTI as DE95015258

Source

  • COCOON `95: computing and combinatorics, Xian (China), Jun 1995

Language

Item Type

Identifier

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

  • Other: DE95015258
  • Report No.: LA-UR--95-1981
  • Report No.: CONF-9506248--1
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 102187
  • Archival Resource Key: ark:/67531/metadc623480

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

  • July 1, 1995

Added to The UNT Digital Library

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

Description Last Updated

  • Feb. 25, 2016, 2:06 p.m.

Usage Statistics

When was this article last used?

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

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. Compact location problems with budget and communication constraints, article, July 1, 1995; New Mexico. (digital.library.unt.edu/ark:/67531/metadc623480/: accessed January 21, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.