Sciweavers

99 search results - page 7 / 20
» Directed Feedback Vertex Set Problem is FPT
Sort
View
JAIR
2010
99views more  JAIR 2010»
13 years 5 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
MFCS
2009
Springer
14 years 1 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
FCT
2009
Springer
14 years 1 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
AUTOMATICA
2002
111views more  AUTOMATICA 2002»
13 years 7 months ago
Virtual reference feedback tuning: a direct method for the design of feedback controllers
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
M. C. Campi, A. Lecchini, Sergio M. Savaresi
SPAA
2010
ACM
14 years 5 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
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...
Matti Åstrand, Jukka Suomela