FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1595632071> ?p ?o ?g. }

• W1595632071 abstract "Directed hypergraphs are used in several applications to model different combinatorial structures. A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. A hyperpath, similarly to the notion of path in directed graphs, consists of a connection among nodes using hyperarcs. Unlike paths in graphs, however, hyperpaths are suitable of many different definitions of measure, which have been used in a wide set of applications. Not surprisingly, depending on the considered measure function the cost of finding optimal hyperpaths may range from NP-hard to linear time.  A first solution for finding optimal hyperpaths in case of a superior functions (SUP) can be found in a seminal work by Knuth [Knu77], which generalizes Dijkstra's Algorithm [Dij59] to deal with a grammar problem. This solution is further extended by Ramalingam and Reps [RR96] to deal with weakly superior functions (WSUP). Dijkstra's priority queue can find optimal paths or hyperpaths if the measure function complies two hypotheses: it is mono- tone with respect to all its arguments and (multidimensional) triangle inequality holds. We show that monotonicity - alone - is sufficient to guarantee interesting properties, and to make some optimization algorithms effective. Hence we introduce the generalized superior function (GSUP), and consider the symmetrical classes of inferior functions, giving rise to a hierarchy of classes of optimization problems on directed hypergraphs. After showing that some measure functions might induce cycles in optimal hyperpaths, we come up to another taxonomy of measure functions, based on the structure of the optimal hyperpaths they determine, and relate the two hierarchies.  Finally we introduce a general algorithmic pattern for the single-source optimal hyperpath problem encompassing existing and new algorithms, and compare their effectiveness in various cases, including the case of optimal cyclic hyperpaths." @default.
• W1595632071 created "2016-06-24" @default.
• W1595632071 creator A5001847360 @default.
• W1595632071 creator A5060167915 @default.
• W1595632071 creator A5067785817 @default.
• W1595632071 creator A5086186456 @default.
• W1595632071 creator A5086753756 @default.
• W1595632071 date "2010-12-20" @default.
• W1595632071 modified "2023-09-26" @default.
• W1595632071 title "Classification and Traversal Algorithmic Techniques for Optimization Problems on Directed Hyperpaths" @default.
• W1595632071 cites W138558962 @default.
• W1595632071 cites W1492532605 @default.
• W1595632071 cites W1500488572 @default.
• W1595632071 cites W1507039213 @default.
• W1595632071 cites W1517582008 @default.
• W1595632071 cites W1529490620 @default.
• W1595632071 cites W1530753374 @default.
• W1595632071 cites W1546862091 @default.
• W1595632071 cites W1556771345 @default.
• W1595632071 cites W1565413026 @default.
• W1595632071 cites W1583938339 @default.
• W1595632071 cites W1594141785 @default.
• W1595632071 cites W165407004 @default.
• W1595632071 cites W1971433976 @default.
• W1595632071 cites W1975638108 @default.
• W1595632071 cites W1981296835 @default.
• W1595632071 cites W2011039300 @default.
• W1595632071 cites W2029706450 @default.
• W1595632071 cites W2047197934 @default.
• W1595632071 cites W2054784808 @default.
• W1595632071 cites W2060772802 @default.
• W1595632071 cites W2061936891 @default.
• W1595632071 cites W2064529725 @default.
• W1595632071 cites W2065002018 @default.
• W1595632071 cites W2076358787 @default.
• W1595632071 cites W2082049134 @default.
• W1595632071 cites W2083786039 @default.
• W1595632071 cites W2084224084 @default.
• W1595632071 cites W2108336404 @default.
• W1595632071 cites W2112660220 @default.
• W1595632071 cites W2115753373 @default.
• W1595632071 cites W2131423065 @default.
• W1595632071 cites W2137684376 @default.
• W1595632071 cites W2143160898 @default.
• W1595632071 cites W2155967165 @default.
• W1595632071 cites W2169528473 @default.
• W1595632071 cites W30613216 @default.
• W1595632071 cites W80772221 @default.
• W1595632071 cites W84362026 @default.
• W1595632071 cites W141823634 @default.
• W1595632071 cites W2030827961 @default.
• W1595632071 hasPublicationYear "2010" @default.
• W1595632071 type Work @default.
• W1595632071 sameAs 1595632071 @default.
• W1595632071 citedByCount "0" @default.
• W1595632071 crossrefType "journal-article" @default.
• W1595632071 hasAuthorship W1595632071A5001847360 @default.
• W1595632071 hasAuthorship W1595632071A5060167915 @default.
• W1595632071 hasAuthorship W1595632071A5067785817 @default.
• W1595632071 hasAuthorship W1595632071A5086186456 @default.
• W1595632071 hasAuthorship W1595632071A5086753756 @default.
• W1595632071 hasConcept C11413529 @default.
• W1595632071 hasConcept C118615104 @default.
• W1595632071 hasConcept C126255220 @default.
• W1595632071 hasConcept C132525143 @default.
• W1595632071 hasConcept C134306372 @default.
• W1595632071 hasConcept C140745168 @default.
• W1595632071 hasConcept C146380142 @default.
• W1595632071 hasConcept C173870130 @default.
• W1595632071 hasConcept C177264268 @default.
• W1595632071 hasConcept C199360897 @default.
• W1595632071 hasConcept C22590252 @default.
• W1595632071 hasConcept C2780009758 @default.
• W1595632071 hasConcept C2781221856 @default.
• W1595632071 hasConcept C33923547 @default.
• W1595632071 hasConcept C41008148 @default.
• W1595632071 hasConcept C72169020 @default.
• W1595632071 hasConcept C77088390 @default.
• W1595632071 hasConceptScore W1595632071C11413529 @default.
• W1595632071 hasConceptScore W1595632071C118615104 @default.
• W1595632071 hasConceptScore W1595632071C126255220 @default.
• W1595632071 hasConceptScore W1595632071C132525143 @default.
• W1595632071 hasConceptScore W1595632071C134306372 @default.
• W1595632071 hasConceptScore W1595632071C140745168 @default.
• W1595632071 hasConceptScore W1595632071C146380142 @default.
• W1595632071 hasConceptScore W1595632071C173870130 @default.
• W1595632071 hasConceptScore W1595632071C177264268 @default.
• W1595632071 hasConceptScore W1595632071C199360897 @default.
• W1595632071 hasConceptScore W1595632071C22590252 @default.
• W1595632071 hasConceptScore W1595632071C2780009758 @default.
• W1595632071 hasConceptScore W1595632071C2781221856 @default.
• W1595632071 hasConceptScore W1595632071C33923547 @default.
• W1595632071 hasConceptScore W1595632071C41008148 @default.
• W1595632071 hasConceptScore W1595632071C72169020 @default.
• W1595632071 hasConceptScore W1595632071C77088390 @default.
• W1595632071 hasIssue "18" @default.
• W1595632071 hasLocation W15956320711 @default.
• W1595632071 hasOpenAccess W1595632071 @default.
• W1595632071 hasPrimaryLocation W15956320711 @default.
• W1595632071 hasRelatedWork W1642903541 @default.

• next