56 search results - page 8 / 12 » Decorous Lower Bounds for Minimum Linear Arrangement |
GD
2003
Springer
13 years 12 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
ICALP
2004
Springer
14 years 2 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
JSAC
2007
13 years 6 months ago
2007
Abstract— In this paper we study the effects of practical pilotassisted channel state estimation on the achievable information theoretic data rates (uplink and downlink) in a mul...