500 search results - page 77 / 100 » Approximation algorithms for maximum independent set of pseu... |
172
click to vote
ALT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
156
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
154
click to vote
ESA
2009
Springer
16 years 19 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
208
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
262
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...