791 search results - page 71 / 159 » Approximating the Maximum Sharing Problem |
DAM
2010
13 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. In many vision problems, the observed data lies in a nonlinear manifold in a high-dimensional space. This paper presents a generic modelling scheme to characterize the no...
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
NA
2010
13 years 6 months ago
2010
In the numerical solution of ODEs, it is now possible to develop efficient techniques that will deliver approximate solutions that are piecewise polynomials. The resulting methods...