65 search results - page 6 / 13 » Two Polynomial Time Algorithms for the Metro-line Crossing M... |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
SIAMCOMP
2000
13 years 8 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
ICCAD
2009
IEEE
13 years 6 months ago
2009
IEEE
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
ROBOCOMM
2007
IEEE
14 years 2 months ago
2007
IEEE
—For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless com...