Keyword: combinatorial analysis

Found 435 papers in total
Reconstructing shortest paths
Reconstructing shortest paths
1989,
This paper develops a polynomial-time algorithm that reconstructs a shortest path...
Algorithms using a branch and bound method for finding all real solutions to an equation of one variable
Algorithms using a branch and bound method for finding all real solutions to an equation of one variable
1989,
This paper, proposes algorithms using a branch and bound method for finding all real...
Edge-packings of graphs and network reliability
Edge-packings of graphs and network reliability
1988,
The reliability of a network can be efficiently bounded using graph-theoretical...
Distances and cuts in planar graphs
Distances and cuts in planar graphs
1989,
The paper proves the following theorem. Let G =( V,E ) be a planar bipartite graph,...
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 clustering problems with connected optima in Euclidean spaces
On clustering problems with connected optima in Euclidean spaces
1989,
Let X be a finite subset of a Euclidean space, and ρ be a real function defined on...
An on-line graph coloring algorithm with sublinear performance ratio
An on-line graph coloring algorithm with sublinear performance ratio
1989,
One of the simplest heuristics for obtaining a proper coloring of a graph is the...
A new class of heuristic algorithms for weighted perfect matching
A new class of heuristic algorithms for weighted perfect matching
1988,
The minimum-weight perfect matching problem for complete graphs of n vertices with...
Optimizing over a slice of the bipartite matching polytope
Optimizing over a slice of the bipartite matching polytope
1988,
The paper discusses a special case of the Exact Perfect Matching Problem, which is...
A multiply constrained matroid optimization problem
A multiply constrained matroid optimization problem
1988,
The authors consider the problem of finding a minimum weight basis in a matroid...
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...
Rectilinear shortest paths in the presence of rectangular barriers
Rectilinear shortest paths in the presence of rectangular barriers
1989,
In this paper the authors address the following shortest-path problem. Given a point...
A simple linear expected time algorithm for finding a Hamiltonian path
A simple linear expected time algorithm for finding a Hamiltonian path
1989,
The paper gives a simple algorithm which either finds a hamilton path between two...
Logic-based decision support
Logic-based decision support
1989,
This monograph is directly based on a series of ten lectures, of the same title, given...
A new approach to the maximum-flow problem
A new approach to the maximum-flow problem
1988,
All previously known efficient maximum-flow algorithms work by finding augmenting...
As fast parametric maximum flow algorithm and applications
As fast parametric maximum flow algorithm and applications
1989,
The classical maximum flow problem sometimes occurs in settings in which the arc...
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...
Note on Weintraub’s minimum-cost circulation algorithm
Note on Weintraub’s minimum-cost circulation algorithm
1989,
In 1974 Weintraub published an algorithm for the minimum-cost circulation problems...
On the efficiency of maximum-flow algorithms on networks with small integer capacities
On the efficiency of maximum-flow algorithms on networks with small integer capacities
1989,
The performance of maximum-flow algorithms that work in phases is studied as a...
Extremum properties of hexagonal partitioning and the uniform distribution in Euclidean location
Extremum properties of hexagonal partitioning and the uniform distribution in Euclidean location
1988,
A zero-sum game with a maximizer that selects a point x in given polygon R in the...
Improved complexity bounds for center location problems on networks by using dynamic data structures
Improved complexity bounds for center location problems on networks by using dynamic data structures
1988,
Several center location problems on general networks and even on tree networks are...
Scheduling precedence graphs in systems with interprocessor communication times
Scheduling precedence graphs in systems with interprocessor communication times
1989,
The problem of nonpreemptively scheduling a set of m partially ordered tasks on n...
Minimizing schedule length subject to minimum flow time
Minimizing schedule length subject to minimum flow time
1989,
The problem of scheduling n independent tasks on m ≥1 identical processors, with...
Scheduling tree-structured tasks on two processors to minimize schedule length
Scheduling tree-structured tasks on two processors to minimize schedule length
1989,
Consider a set of n tasks with a tree-structured precedence relation and execution...
Papers per page: