354 search results - page 70 / 71 » Algorithms for the Minimum Edge Cover of H-Subgraphs of a Gr... |
FOCS
2009
IEEE
14 years 1 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...
COMPGEOM
1994
ACM
13 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
TASE
2010
IEEE
13 years 1 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...