Cited by 5Complexity and Algorithms in GraphsAdvanced Multi-Objective Optimization AlgorithmsOptimization and Mathematical Programming

Efficiently Optimizing for Dendritic Connectivity on Tree-Structured Networks in a Multi-Objective Framework

Open access
Shi, Qinru, Gomes-Selman, Jonathan M., García-Villacorta, Roosevelt, Sethi, Suresh, Flecker, Alexander S., Gomes, Carla P.·2018·Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies

Abstract

We provide an exact and approximation algorithm based on Dynamic Programming and an approximation algorithm based on Mixed Integer Programming for optimizing for the so-called dendritic connectivity on tree-structured networks in a multi-objective setting. Dendritic connectivity describes the degree of connectedness of a network. We consider different variants of dendritic connectivity to capture both network connectivity with respect to long and short-to-middle distances. Our work is motivated by a problem in computational sustainability concerning the evaluation of trade-offs in ecosystem services due to the proliferation of hydropower dams throughout the Amazon basin. In particular, we consider trade-offs between energy production and river connectivity. River fragmentation can dramatically affect fish migrations and other ecosystem services, such as navigation and transportation. In the context of river networks, different variants of dendritic connectivity are important to characterize the movements of different fish species and human populations. Our approaches are general and can be applied to optimizing for dendritic connectivity for a variety of multi-objective problems on tree-structured networks.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3209811.3209878

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • This approach has been applied in a number of climate change-related fields, including energy and infrastructure planning, industry, land use, and more.

    “This approach has been applied in a number of climate change-related fields, including energy and infrastructure planning [38,325,525,635,732,856], industry [122,334], land use [462,809], and more [127,317,539,761].”

    From Tackling climate change with machine learning (2023) · cites this paper as [732]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Shi, Q., Gomes-Selman, J. M., García-Villacorta, R., Sethi, S., Flecker, A. S., & Gomes, C. P.
Affiliations
  • Cornell University (US)
  • Stanford University (US)
  • Department of Ecology and Evolutionary, Biology, Cornell University
  • United States Geological Survey (US)
Venue
Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies
Publisher
ACM
Published
2018-06-20
Pages
1-8
OpenAlex
W2809361363
Cited by
5
References
30
Citations by year
2023: 1 · 2022: 4
FWCI
0.00
Type
conference paper
Language
en
Open access
Locations
ACM SIGCAS Conference on Computing and Sustainable Societies (COMPASS) (publishedVersion)
Funders
Division of Computing and Communication Foundations (1522054)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
  • Physical Sciences › Engineering › Control and Systems Engineering › Optimization and Mathematical Programming
Keywords
tree-structured networks, multi-objective optimization, river networks, river fragmentation, hydroelectric dams, Amazon basin, ecosystem service trade-offs, fish migration, river connectivity, dynamic programming, mixed integer programming, approximation algorithms

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review