Sciweavers

ISAAC
1992
Springer
186views Algorithms» more  ISAAC 1992»
13 years 8 months ago
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
13 years 8 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
13 years 8 months ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu
ISAAC
1992
Springer
82views Algorithms» more  ISAAC 1992»
13 years 8 months ago
Lowness and the Complexity of Sparse and Tally Descriptions
Vikraman Arvind, Johannes Köbler, Martin Mund...