Country: Netherlands

Found 18376 papers in total
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under -distance
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under -distance
1992,
In this paper, the weighted tailored 2-partition problem and the weighted 2-center...
Matching parentheses in parallel
Matching parentheses in parallel
1992,
Parallel algorithms for evaluating arithmetic expressions generally assume the...
The capacity of the subarray partial concentrators
The capacity of the subarray partial concentrators
1992,
A partial concentrator with parameters n,m, and c , is an n (inputs)× m...
Strong elimination ordering of the total graph of a tree
Strong elimination ordering of the total graph of a tree
1992,
Total graphs of trees were proved strongly chordal by Martin Farber. The authors give...
Search and sweep numbers of finite directed acyclic graphs
Search and sweep numbers of finite directed acyclic graphs
1993,
The search number of a graph is the least number of searchers needed to find any...
Coloring drawings of bipartite graphs: A problem in automated assembly
Coloring drawings of bipartite graphs: A problem in automated assembly
1993,
Several workpiece carriers or vehicles are tethered to fixed bases. The vehicles are...
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
1993,
An in-tournament digraph is a digraph in which the set of in-neighbours of every...
Stability number of bull- and chair-free graphs
Stability number of bull- and chair-free graphs
1993,
A bull is the graph with vertices a,b,c,d,e and edges ab,ac,bc,ad,be; a chair is the...
General vertex disjoint paths in series-parallel graphs
General vertex disjoint paths in series-parallel graphs
1993,
Let G=(V,E) be an undirected graph and let ( s i ,t i ), 1•i•k be k pairs of...
Optimal multiple interval assignments in frequency assignment and traffic phasing
Optimal multiple interval assignments in frequency assignment and traffic phasing
1992,
The paper considers the optimal assignments of unions of intervals to the vertices of...
Estimation of information systems development efforts
Estimation of information systems development efforts
1992,
This study attempts to identify estimation methods, underlying variables and factors...
Probability of diameter two for Steinhaus graphs
Probability of diameter two for Steinhaus graphs
1993,
A Steinhaus graph is a graph with n vertices whose adjacency matrix satisfies the...
Algorithms for routing around a rectangle
Algorithms for routing around a rectangle
1992,
Simple efficient algorithms are given for three routing problems around a rectangle....
Characterizations of max-balanced flows
Characterizations of max-balanced flows
1992,
Let G=(V,A) be a graph with vertex set V and arc set a. A flow for G is an arbitrary...
Recognizing hidden bicircular networks
Recognizing hidden bicircular networks
1993,
In this and a subsequent paper, the authors introduce a polynomial-time algorithm for...
Generalization of a theorem on the parametric maximum flow problem
Generalization of a theorem on the parametric maximum flow problem
1993,
A general theorem on the nesting property of minimum cuts in a parametric network and...
On better heuristics for Steiner minimum trees
On better heuristics for Steiner minimum trees
1992,
Finding a shortest network interconnecting a given set of points in a metric space is...
Deciding uniqueness in norm maximization
Deciding uniqueness in norm maximization
1992,
NP-hardness is established for the problem whose instance is a system of linear...
On average complexity of global optimization problems
On average complexity of global optimization problems
1992,
The average case complexity of global optimization problems is discussed. The average...
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
1992,
This paper introduces a unified framework for the analysis of a class of random...
An interior point algorithm of
An interior point algorithm of
1992,
The authors present a theoretical result on a path-following algorithm for convex...
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
1992,
The authors show that a modified variant of the interior point method can solve linear...
On the finite convergence of interior-point algorithms for linear programming
On the finite convergence of interior-point algorithms for linear programming
1992,
It has been shown that numerous interior-point algorithms for linear programming (LP)...
A continuous approach to inductive inference
A continuous approach to inductive inference
1992,
In this paper the authors describe an interior point mathematical programming approach...
Papers per page: