851 search results - page 10 / 171 » An exact algorithm for solving the vertex separator problem |
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
EOR
2007
13 years 8 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
EOR
2006
13 years 8 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
ICCAD
1997
IEEE
14 years 19 days ago
1997
IEEE
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...