500 search results - page 23 / 100 » Approximation algorithms for maximum independent set of pseu... |
113
click to vote
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
145
click to vote
ASAP
2004
IEEE
15 years 5 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
110
Voted
STACS
2001
Springer
15 years 6 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
125
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...