Covering edges in networks

DOI10.1002/net.21924zbMath1526.90026WikidataQ126396738 ScholiaQ126396738MaRDI QIDQ6087399

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

Publication date: 15 November 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

network locationNP-hardnesscomputational studyedge coverfinite dominating setapproximability

Mathematics Subject Classification ID

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

Related Items (2)

Minmax regret maximal covering location problems with edge demands ⋮ Upgrading edges in the maximal covering location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On covering location problems on networks with edge demand
• Designing emergency response networks for hazardous materials transportation
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
• The Design of Approximation Algorithms
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
• Finite Dominating Sets for Network Location Problems
• The Centers and Medians of a Graph
• An aggregation approach to solving the networkp-median problem with link demands
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

This page was built for publication: Covering edges in networks