851 search results - page 32 / 171 » An exact algorithm for solving the vertex separator problem |
139
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
138
click to vote
FUN
2007
Springer
15 years 7 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
135
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
143
Voted
TIP
2008
15 years 3 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
111
Voted
JAL
2002
15 years 3 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...