Static and dynamic source locations in undirected networks
DOI10.1007/S11750-015-0395-7zbMATH Open1327.90030OpenAlexW2200564040MaRDI QIDQ889101FDOQ889101
Authors: Lara Turner, Dwi Poetranto Groß, Horst W. Hamacher, Sven O. Krumke 
Publication date: 6 November 2015
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-015-0395-7
Recommendations
matroidNP-hardnesstree networkpseudo-polynomial algorithmfully polynomial-time approximation schemedynamic flowlinear algorithm(dual) greedy algorithm(minimal) deficient setplural cover problemsingle cover problemsource location problemstatic networks
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Greedy Heuristic for the Set-Covering Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic Aspects of Graph Connectivity
- Title not available (Why is that?)
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Multi-Terminal Network Flows
- Cyclic Scheduling via Integer Programs with Circular Ones
- Constructing maximal dynamic flows from static flows
- Title not available (Why is that?)
- Sink location to find optimal shelters in evacuation planning
- Minimum Cost Source Location Problems with Flow Requirements
- The multi terminal \(q\)-FlowLoc problem: a heuristic
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Exact algorithms and applications for tree-like Weighted Set Cover
- An algorithm for source location in directed graphs
- Locating sources to meet flow demands in undirected networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimum transversals in posimodular systems
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
- A generalization of the weighted set covering problem
- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Minimum cost source location problems with flow requirements
- Source location with rigidity and tree packing requirements
- Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
- Source location problems considering vertex-connectivity and edge-connectivity simultaneously
- Maximum-cover source location problems with objective edge-connectivity three
- Minimum cost source location problem with local 3-vertex-connectivity requirements
- Transversals of subtree hypergraphs and the source location problem in digraphs
- A note on two source location problems
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Multi-commodity Source Location Problems and Price of Greed
- Algorithms and Computation
- Source location in undirected and directed hypergraphs
Cited In (5)
- Rejoinder on: ``Static and dynamic source locations in undirected networks
- The network source location problem: ground state energy, entropy and effects of freezing
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
- Sink location to find optimal shelters in evacuation planning
- Comments on: ``Static and dynamic source locations in undirected networks
Uses Software
This page was built for publication: Static and dynamic source locations in undirected networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889101)
