Sciweavers

IPL
2007
70views more  IPL 2007»
13 years 5 months ago
An improved approximation ratio for the minimum linear arrangement problem
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
Uriel Feige, James R. Lee
IPL
2007
52views more  IPL 2007»
13 years 5 months ago
The hardness of the Expected Decision Depth problem
Dana Ron, Amir Rosenfeld, Salil P. Vadhan
IPL
2007
107views more  IPL 2007»
13 years 5 months ago
Flows in dynamic networks with aggregate arc capacities
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Vardges Melkonian
IPL
2007
111views more  IPL 2007»
13 years 5 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
IPL
2007
99views more  IPL 2007»
13 years 5 months ago
Dynamic programming algorithms for the mosaic longest common subsequence problem
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yu...
IPL
2007
74views more  IPL 2007»
13 years 5 months ago
Minimum cycle bases of direct products of complete graphs
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...
Richard Hammack
IPL
2007
87views more  IPL 2007»
13 years 5 months ago
The forwarding indices of augmented cubes
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
Min Xu, Jun-Ming Xu