330 search results - page 9 / 66 » Approximation Algorithms for the Directed k-Tour and k-Strol... |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
IPCCC
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
SPAA
2010
ACM
14 years 9 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...