3874 search results - page 468 / 775 » Approximation Algorithms for k-hurdle Problems |
164
click to vote
WINE
2005
Springer
15 years 11 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...
161
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this letter, a new class of nonlinear filters called vector median-rational hybrid filters (VMRHF's) for multispectral image processing is introduced and applied to the col...
207
click to vote
ISSAC
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
170
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...