9842 search results - page 446 / 1969 » The Complexity of the Matching-Cut Problem |
266
Voted
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
214
Voted
FCT
2007
Springer
15 years 11 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
214
click to vote
EMO
2006
Springer
15 years 11 months ago
2006
Springer
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
206
click to vote
AIPS
2007
15 years 9 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
181
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...