2698 search results - page 93 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
137
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
166
click to vote
STOC
2009
ACM
16 years 6 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,...
210
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
145
click to vote
EUSFLAT
2007
15 years 7 months ago
2007
This paper concerns problem of selection of optimal subset of irredundant unconditional diagnostic tests by means of evolutionary approach. The method of correction of features’...
171
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...