114 search results - page 18 / 23 » Engineering Algorithms for Approximate Weighted Matching |
101
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
156
Voted
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
117
click to vote
TCOM
2010
14 years 10 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
100
click to vote
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...