3415 search results - page 322 / 683 » Lower bounds on kernelization |
165
Voted
CPC
2008
15 years 6 months ago
2008
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
120
click to vote
DM
2010
15 years 6 months ago
2010
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
152
Voted
ENDM
2010
15 years 6 months ago
2010
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
160
click to vote
EOR
2006
15 years 6 months ago
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
184
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...