𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering a poset by interval orders

✍ Scribed by Douglas B West

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
121 KB
Volume
66
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A generalization of interval orders
A generalization of interval orders
✍ A. Tsoukias; Ph. Vincke πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 427 KB
The order-interval hypergraph of a finit
The order-interval hypergraph of a finite poset and the KΓΆnig property
✍ Isma Bouchemakh; Konrad Engel πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 561 KB

We study the hypergraph ~(P) whose vertices are the points of a finite poset and whose edges are the maximal intervals in P (i.e. sets of the form I = {v ~ P:p <~ v <<. q}, p minimal, q maximal). We mention resp. show that the problems of the determination of the independence number c~, the point co

A setup heuristic for interval orders
A setup heuristic for interval orders
✍ Ulrich Faigle; Rainer Schrader πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 258 KB
Pushdown–reduce: an algorithm for connec
Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems
✍ AndrΓ‘s A. BenczΓΊr πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 557 KB

In their seminal paper, Frank and Jordà an show that a large class of optimization problems including certain directed edge augmentation ones fall into the class of covering supermodular functions over pairs of sets. They also give an algorithm for such problems, however, that relies on the ellipsoi

A bound on the dimension of interval ord
A bound on the dimension of interval orders
✍ K.P Bogart; Issie Rabinovich; W.T Trotter Jr. πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 605 KB