Abstract
The cost of hyperpaths in directed hypergraphs can be measuread in various different ways, which have been used in a wide set of applications. Not surprisingly, depending on the considered measure function the cost to find optimum hyperpaths may range from NP-hard to linear time. A first solution for finding optimum hyperpaths in case of a superior functions (SUP) can be found in a seminal work by Knuth [5], which generalizes Dijkstra’s Algorithm [3] to deal with a grammar problem. In this paper we define a hierarchy of classes of optimization problems based on the properties of the cost measures. After showing that measures can be classified on the basis of the structure of the optimum hyperpath they determine, we present an alternative taxonomy of measure functions, based on their analytic properties, and prove structure theorems that relate the two hierarchies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ausiello, G., D’Atri, A., Saccà, D.: Minimal representation of directed hypergraphs. SIAM Journal on Computing 15, 418–431 (1986)
Ausiello, G., Italiano, G.F., Laura, L., Nanni, U., Sarracco, F.: Classification and traversal algorithmic techniques for optimization problems on directed hyperpaths. Technical Report TR-18-10, Department of Computer and System Sciences, Università di Roma La Sapienza, Roma, Italy (2010)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)
Gallo, G., Longo, G., Nguyen, S., Pallottino, S.: Directed hypergraphs and applications. Discrete Applied Mathematics 42, 177–201 (1993)
Knuth, D.E.: A generalization of Dijkstra’s Algorithm. Information Processing Letters 6(1), 1–5 (1977)
Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest path problem. Journal of Algorithms 21(2), 267–305 (1996)
Thakur, M., Tripathi, R.: Linear connectivity problems in directed hypergraphs. Theoretical Computer Science 410(27-29), 2592–2618 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ausiello, G., Italiano, G.F., Laura, L., Nanni, U., Sarracco, F. (2012). Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-32147-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32146-7
Online ISBN: 978-3-642-32147-4
eBook Packages: Computer ScienceComputer Science (R0)