33 search results - page 6 / 7 » Polynomial-Time Approximation Schemes for Subset-Connectivit... |
FSTTCS
2009
Springer
14 years 5 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
STACS
2004
Springer
13 years 11 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
ISAAC
2009
Springer
14 years 5 days ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
DIALM
2003
ACM
13 years 11 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...