1433 search results - page 20 / 287 » On Covering Problems of Rado |
116
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
103
click to vote
AICCSA
2007
IEEE
15 years 6 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
WALCOM
2010
IEEE
15 years 6 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
133
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
105
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph