9842 search results - page 406 / 1969 » The Complexity of the Matching-Cut Problem |
161
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
127
Voted
EVOW
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
120
Voted
IFIP3
2008
15 years 6 months ago
2008
The Web is widely used, in educational settings, typically as a repository of contents to be learned. Within this approach, the Web-searching process tends to be perceived merely a...
132
click to vote
WCE
2007
15 years 5 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
143
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...