Sciweavers

CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 2 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
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...
Bart Jansen
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
13 years 8 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
13 years 2 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
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 ...
Leizhen Cai, Boting Yang
CIAC
2010
Springer
278views Algorithms» more  CIAC 2010»
13 years 10 months ago
Maximizing PageRank with new Backlinks
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...
Martin Olsen
CIAC
2010
Springer
275views Algorithms» more  CIAC 2010»
14 years 2 months ago
Online Cooperative Cost Sharing
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...
Janina Brenner and Guido Schaefer
Algorithms
Top of PageReset Settings