841 search results - page 27 / 169 » Approximability of Minimum AND-Circuits |
CDC
2010
IEEE
13 years 17 days ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
COCOON
2006
Springer
14 years 20 days ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
DAM
1999
13 years 8 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
JDA
2007
13 years 8 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
IPL
2008
13 years 9 months ago
2008
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...