160 search results - page 23 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
140
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
164
click to vote
ECCC
2011
14 years 10 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
121
click to vote
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
SODA
2008
ACM
15 years 4 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
136
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...