Sciweavers

99 search results - page 18 / 20
» Directed Feedback Vertex Set Problem is FPT
Sort
View
FOCS
2002
IEEE
13 years 11 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
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...
Amit Kumar, Anupam Gupta, Tim Roughgarden
EDBT
2010
ACM
152views Database» more  EDBT 2010»
13 years 9 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
GECCO
2009
Springer
126views Optimization» more  GECCO 2009»
13 years 11 months ago
Improving NSGA-II with an adaptive mutation operator
The performance of a Multiobjective Evolutionary Algorithm (MOEA) is crucially dependent on the parameter setting of the operators. The most desired control of such parameters pre...
Arthur Gonçalves Carvalho, Aluizio F. R. Ar...
FOCS
2008
IEEE
14 years 21 days ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ALGOSENSORS
2008
Springer
13 years 8 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...