1395 search results - page 226 / 279 » (k, )-Distance-Hereditary Graphs |
106
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
128
Voted
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
133
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
107
Voted
RECSYS
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
139
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
With the increase of the training set’s size, the efficiency of support vector machine (SVM) classifier will be confined. To solve such a problem, a novel preextracting method f...