Sciweavers

1429 search results - page 15 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de...
ICALP
2007
Springer
14 years 1 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
ECCC
2007
86views more  ECCC 2007»
13 years 7 months ago
On Parameterized Approximability
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Yijia Chen, Martin Grohe, Magdalena Grüber
COCOON
2005
Springer
14 years 1 months ago
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Jinsong Tan, Kok Seng Chua, Louxin Zhang
INFOCOM
2002
IEEE
14 years 12 days ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...