Covering edges in networks

DOI10.1002/NET.21924MaRDI QIDQ6087399zbMATH OpenWikidataFDO

Authors Nicolas Fröhlich, Andrea Maier, Horst W. Hamacher

Publication date 15 November 2023

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

edge coverNP-hardnesscomputational studyfinite dominating setnetwork locationapproximability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Continuous location (90B85)

Recommendations

• On covering location problems on networks with edge demand
• Efficient algorithms for the conditional covering problem
• Covering part of a planar network
• A minimum length covering subgraph of a network
• scientific article; zbMATH DE number 9246

Cites work

• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 3495588 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• An aggregation approach to solving the networkp-median problem with link demands
• Designing emergency response networks for hazardous materials transportation
• Finite Dominating Sets for Network Location Problems
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
• On covering location problems on networks with edge demand
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• The Centers and Medians of a Graph
• The design of approximation algorithms

Cited in

(6)

• scientific article; zbMATH DE number 6871091 (Why is no real title available?)
• Covering Arrays Avoiding Forbidden Edges
• Edge covering problem under hybrid uncertain environments
• On the complexity of the upgrading version of the maximal covering location problem
• Minmax regret maximal covering location problems with edge demands
• Upgrading edges in the maximal covering location problem

This page was built for publication: Covering edges in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087399)