233 search results - page 4 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
GD
2001
Springer
14 years 5 days ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
Energy consumption is an important performance parameter for portable and wireless embedded systems. However, energy consumption must be carefully balanced with real-time responsi...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...