Journal: Information Processing Letters

Found 137 papers in total
Greedy online frequency allocation in cellular networks
Greedy online frequency allocation in cellular networks
2007,
The online frequency allocation problem for cellular networks has been well studied in...
Darts and hoopla board design
Darts and hoopla board design
2004,
Dartboard design can be seen as an instance of the travelling salesman problem with...
On the Euclidean travelling salesman problem with a permuted Van der Veen matrix
On the Euclidean travelling salesman problem with a permuted Van der Veen matrix
2004,
We discuss the problem of recognizing permuted Van der Veen (VdV) matrices. It is well...
On the feedback vertex set problem in permutation graphs
On the feedback vertex set problem in permutation graphs
1994,
Brandstat and Kratsch presented an O( n 6 ) time algorithm for the minimum weight...
An optimal sublinear time parallel algorithm for some dynamic-programming problems
An optimal sublinear time parallel algorithm for some dynamic-programming problems
1994,
We consider the following problem: minimize the time of optimal parallel computations...
On the point-to-point connection problem
On the point-to-point connection problem
1995,
A Dijsktra-like algorithm for solving the point-to-point connection problem on a...
Effective use of memory in iterative deepening search
Effective use of memory in iterative deepening search
1992,
The Iterative Deepening A* (IDA*) algorithm often reexpands too many nodes...
Multiple stack branch and bound
Multiple stack branch and bound
1991,
A multiple stack branch and bound (MSBB) algorithm which uses a multiple stack data...
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack-problem
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack-problem
1992,
The Non-Increasing First Fit (NIFF) greedy algorithm for the 0/1 knapsack problem does...
An algorithm for colouring perfect planar graphs
An algorithm for colouring perfect planar graphs
1989,
This paper presents an algorithm to properly colour a perfect, planar graph G using...
On max-flow min-cut and integral flow properties for multocommodity flows in directed networks
On max-flow min-cut and integral flow properties for multocommodity flows in directed networks
1989,
The multicommodity flow problem can represent many important problems encountered in a...
An approximation algorithm for the TSP
An approximation algorithm for the TSP
1989,
The authors present a new polynomial-time heuristic algorithm for finding a solution...
Bin packing with restricted piece sizes
Bin packing with restricted piece sizes
1989,
Coffman et al. have recently shown that a large number of bin-packing problems can be...
An O(Nlog2N) algorithm for the maximum weighted tardiness problem
An O(Nlog2N) algorithm for the maximum weighted tardiness problem
1989,
The authors give an O( n log 2 n ) algorithm which solves the scheduling problem of...
Average-case analysis of the Smart Next Fit algorithm
Average-case analysis of the Smart Next Fit algorithm
1989,
This paper, presents the Smart Next Fit algorithm for on-line bin packing, which is...
A parallel algorithm for finding a blocking flow in an acyclic network
A parallel algorithm for finding a blocking flow in an acyclic network
1989,
The authors propose a simple parallel algorithm for finding a blocking flow in an...
Probabilistic analysis of a heuristics for the dual bin packing problem
Probabilistic analysis of a heuristics for the dual bin packing problem
1989,
In this paper the authors study the probabilistic behavior of the first fit increasing...
Papers per page: