16 search results - page 1 / 4 » Approximability of the Multiple Stack TSP |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
TAMC
2009
Springer
13 years 9 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
TSP
2008
13 years 4 months ago
2008
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
TSP
2008
13 years 4 months ago
2008
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...