84 search results - page 14 / 17 » Total weight choosability of graphs |
184
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: The Gene Ontology (GO) is a well known controlled vocabulary describing the biological process, molecular function and cellular component aspects of gene annotation. I...
154
click to vote
CCCG
2007
15 years 7 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
172
click to vote
ESA
2007
Springer
15 years 12 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
175
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
162
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...