Covering edges in networks

DOI10.1002/NET.21924zbMATH Open1526.90026WikidataQ126396738 ScholiaQ126396738MaRDI QIDQ6087399FDOQ6087399

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

Publication date: 15 November 2023

Published in: Networks (Search for Journal in Brave)

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

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)

Cites Work

• The design of approximation algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Finite Dominating Sets for Network Location Problems
• Designing emergency response networks for hazardous materials transportation
• 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
• An aggregation approach to solving the networkp-median problem with link demands
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• Title not available (Why is that?)
• 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
• The Centers and Medians of a Graph

Cited In (6)

• Minmax regret maximal covering location problems with edge demands
• Upgrading edges in the maximal covering location problem
• Title not available (Why is that?)
• 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

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)