841 search results - page 106 / 169 » Approximability of Minimum AND-Circuits |
150
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
141
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
126
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
139
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
107
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...