Source location in undirected and directed hypergraphs

Authors:
Attila BernáTh
Affiliations:
Department of Operations Research, Eötvös University, Pázmány P.s. 1/C, Budapest, H-1117, Egerváry Research Group (EGRES), Hungary
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 0

Directed hypergraphs and applications

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Locating Sources to Meet Flow Demands in Undirected Networks

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A note on the minimization of symmetric and general submodular functions

Discrete Applied Mathematics - Submodularity
An algorithm for source location in directed graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize source location problems with edge-connectivity requirements on undirected and directed graphs to similar problems on hypergraphs. In the undirected case we consider an abstract problem which can be solved in polynomial time. For the directed case, the asymmetry of the results reflects the asymmetry of the model considered.