13603 search results - page 2617 / 2721 » On the Complexity of Computing Treelength |
146
click to vote
CPAIOR
2009
Springer
16 years 29 days ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
172
click to vote
ESA
2009
Springer
16 years 29 days ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
169
click to vote
FSTTCS
2009
Springer
16 years 29 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
146
click to vote
GECCO
2009
Springer
16 years 29 days ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
151
click to vote
OOPSLA
2009
Springer
16 years 28 days ago
2009
Springer
Software correctness has bedeviled the field of computer science since its inception. Software complexity has increased far more quickly than our ability to control it, reaching ...