500 search results - page 64 / 100 » Approximation algorithms for maximum independent set of pseu... |
110
click to vote
TPDS
2008
15 years 1 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
118
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
154
Voted
JMLR
2006
15 years 1 months ago
2006
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...
148
click to vote
SPAA
1999
ACM
15 years 6 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
123
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...