Sciweavers

1433 search results - page 46 / 287
» On Covering Problems of Rado
Sort
View
DAM
2008
139views more  DAM 2008»
14 years 12 months ago
Covering symmetric semi-monotone functions
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
Roland Grappe, Zoltán Szigeti
CORR
2006
Springer
160views Education» more  CORR 2006»
14 years 12 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
DAM
2008
102views more  DAM 2008»
14 years 12 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
15 years 5 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 9 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...