12519 search results - page 111 / 2504 » Approximation Problems Categories |
158
click to vote
AAIM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
153
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
136
click to vote
ISSAC
2007
Springer
16 years 14 days ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
160
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...
190
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...