Sciweavers

Share
85 search results - page 1 / 17
» Complexity of some Path Problems in DAGs and Linear Orders
Sort
View
CORR
2007
Springer
116views Education» more  CORR 2007»
11 years 1 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
COCOON
2005
Springer
11 years 7 months ago
Genome Rearrangements with Partially Ordered Chromosomes
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
Chunfang Zheng, David Sankoff
SAC
2005
ACM
11 years 7 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
ALGORITHMICA
2011
10 years 8 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
MP
2008
129views more  MP 2008»
11 years 1 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
books