𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison of algorithms for minimizing bumps in linear extensions of partial orders

✍ Scribed by William V. Gehrlein; Peter C. Fishburn

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
526 KB
Volume
6
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for minimizing
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re

A Robinson–Schensted Algorithm for a Cla
A Robinson–Schensted Algorithm for a Class of Partial Orders
✍ Thomas S. Sundquist; David G. Wagner; Julian West πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 378 KB

Let P be a finite partial order which does not contain an induced subposet isomorphic with 3+1, and let G be the incomparability graph of P. Gasharov has shown that the chromatic symmetric function X G has nonnegative coefficients when expanded in terms of Schur functions; his proof uses the dual Ja

Minimal order realizations for a class o
Minimal order realizations for a class of positive linear systems
✍ Lorenzo Farina πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 325 KB

The positive realization problem for linear systems is to find, for a given transfer function, all possible realizations with a state spaee of minimal dimension such that the resulting system is a positive system. In this paper, discrete-time positive linear systems having the nonnegative orthant re

A comparison of algorithms for hypertext
A comparison of algorithms for hypertext notes network linearization
✍ Mike Sharples; James Goodlet; Andrew Clutterbuck πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 851 KB

New computer-based writing environments are being developed which combine a hypertext "ideas organizer" with a text editor. We compare two algorithms which could be used in such environments for turning networks of notes indicating ideas into linear draft documents. The algorithms are designed to pr