138
Voted
CIAC
16 years 17 days ago
2010 Springer 
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
148
click to vote
CIAC
15 years 6 months ago
2010 Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
148
click to vote
CIAC
14 years 12 months ago
2010 Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
129
click to vote
CIAC
15 years 8 months ago
2010 Springer 
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
125
click to vote
CIAC
16 years 17 days ago
2010 Springer
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...
|
Algorithms