1416 search results - page 134 / 284 » An Exact Interpretation of While |
164
click to vote
COCO
2009
Springer
16 years 22 days ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
175
click to vote
CSR
2009
Springer
16 years 22 days ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
144
Voted
FSTTCS
2009
Springer
16 years 22 days ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
170
click to vote
GECCO
2009
Springer
16 years 22 days ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
159
click to vote
PROFES
2009
Springer
16 years 21 days ago
2009
Springer
Value-based software engineering (VBSE) is an emerging stream of research that addresses the value considerations of software and extends the traditional scope of software engineer...