Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Obnoxious facility location on graphs

Published: 01 September 1991 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2024)Computing A Well-Representative Summary of Conjunctive Query ResultsProceedings of the ACM on Management of Data10.1145/36958352:5(1-27)Online publication date: 7-Nov-2024
  • (2024)Faster Algorithms for Fair Max-Min Diversification in RdProceedings of the ACM on Management of Data10.1145/36549402:3(1-26)Online publication date: 30-May-2024
  • (2024)Max-Min Diversification with Asymmetric DistancesProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671757(1440-1450)Online publication date: 25-Aug-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics  Volume 4, Issue 4
Nov. 1991
136 pages

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 September 1991

Author Tags

  1. location theory
  2. network center problems
  3. obnoxious facilities

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Computing A Well-Representative Summary of Conjunctive Query ResultsProceedings of the ACM on Management of Data10.1145/36958352:5(1-27)Online publication date: 7-Nov-2024
  • (2024)Faster Algorithms for Fair Max-Min Diversification in RdProceedings of the ACM on Management of Data10.1145/36549402:3(1-26)Online publication date: 30-May-2024
  • (2024)Max-Min Diversification with Asymmetric DistancesProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671757(1440-1450)Online publication date: 25-Aug-2024
  • (2023)On the Distortion of Single Winner Elections with Aligned CandidatesProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3598791(1409-1411)Online publication date: 30-May-2023
  • (2023)A Critical Reexamination of Intra-List Distance and DispersionProceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3539618.3591623(1619-1628)Online publication date: 19-Jul-2023
  • (2023)The ɛ-constraint as a learning strategy in the population-based algorithmKnowledge-Based Systems10.1016/j.knosys.2023.110363265:COnline publication date: 8-Apr-2023
  • (2022)On the distortion of single winner elections with aligned candidatesAutonomous Agents and Multi-Agent Systems10.1007/s10458-022-09567-536:2Online publication date: 1-Oct-2022
  • (2022)Continuous facility location on graphsMathematical Programming: Series A and B10.1007/s10107-021-01646-x192:1-2(207-227)Online publication date: 1-Mar-2022
  • (2021)Dispersing Obnoxious Facilities on a GraphAlgorithmica10.1007/s00453-021-00800-383:6(1734-1749)Online publication date: 1-Jun-2021
  • (2020)Efficient Indexes for Diverse Top-k Range QueriesProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3387667(213-227)Online publication date: 14-Jun-2020
  • Show More Cited By

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media