1429 search results - page 91 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
154
click to vote
TSP
2010
14 years 11 months ago
2010
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
105
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
113
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
119
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
118
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...