Advertisement

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs

  • Giorgio Ausiello
  • Giuseppe F. Italiano
  • Luigi Laura
  • Umberto Nanni
  • Fabiano Sarracco
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7422)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ausiello, G., D’Atri, A., Saccà, D.: Minimal representation of directed hypergraphs. SIAM Journal on Computing 15, 418–431 (1986)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Gallo, G., Longo, G., Nguyen, S., Pallottino, S.: Directed hypergraphs and applications. Discrete Applied Mathematics 42, 177–201 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Knuth, D.E.: A generalization of Dijkstra’s Algorithm. Information Processing Letters 6(1), 1–5 (1977)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest path problem. Journal of Algorithms 21(2), 267–305 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Thakur, M., Tripathi, R.: Linear connectivity problems in directed hypergraphs. Theoretical Computer Science 410(27-29), 2592–2618 (2009)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Giorgio Ausiello
    • 1
  • Giuseppe F. Italiano
    • 2
  • Luigi Laura
    • 1
  • Umberto Nanni
    • 1
  • Fabiano Sarracco
    • 1
  1. 1.Dep. of Computer, Control, and Management Engineering “Antonio Ruberti”Sapienza Univ. of RomeRomaItaly
  2. 2.Dep. of Computer Science, Systems and ProductionUniv. of Rome “Tor Vergata”RomaItaly

Personalised recommendations