7006 search results - page 615 / 1402 » Approximation Algorithms |
183
click to vote
IPL
2007
15 years 7 months ago
2007
We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...
174
click to vote
ALGORITHMICA
2004
15 years 7 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
196
click to vote
ACTA
1998
15 years 7 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
172
click to vote
SIGECOM
2005
ACM
16 years 25 days ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
206
click to vote
VR
2003
IEEE
16 years 16 days ago
2003
IEEE
We present an experiment comparing double exponential smoothing and Kalman filter-based predictive tracking algorithms with derivative free measurement models. Our results show t...