-
1
-
-
33646440993
-
Approximations for minimum and min-max vehicle routing problems
-
article in press
-
Arkin, E. M., Hassin, R. and Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. of Algorithms, (article in press)
-
J. of Algorithms
-
-
Arkin, E.M.1
Hassin, R.2
Levin, A.3
-
2
-
-
0003895164
-
-
Springer, Berlin
-
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.:Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties). Springer, Berlin (1999)
-
(1999)
Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties)
-
-
Ausiello, G.1
Crescenzi, P.2
Gambosi, G.3
Kann, V.4
Marchetti-Spaccamela, A.5
Protasi, M.6
-
3
-
-
84995344698
-
Structure preserving reductions among convex optimization problems
-
Ausiello, G., D'Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. J. Comput. System Sci. 21 (1980) 136-153
-
(1980)
J. Comput. System Sci.
, vol.21
, pp. 136-153
-
-
Ausiello, G.1
D'Atri, A.2
Protasi, M.3
-
4
-
-
0000011818
-
The complexity of approximating a nonlinear program
-
Bellare, M., Rogaway, P.: The complexity of approximating a nonlinear program. Mathematical Programming 69 (1995) 429-441
-
(1995)
Mathematical Programming
, vol.69
, pp. 429-441
-
-
Bellare, M.1
Rogaway, P.2
-
5
-
-
0030143697
-
On an approximation measure founded on the links between optimization and polynomial approximation theory
-
Demange, M., Paschos, V. Th.: On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science 158 (1996) 117-141
-
(1996)
Theoretical Computer Science
, vol.158
, pp. 117-141
-
-
Demange, M.1
Paschos, V.Th.2
-
6
-
-
0001548320
-
Approximation algorithms for some routing problems
-
Frederickson, G. N., Hecht, M. S., Kim, C. E.: Approximation algorithms for some routing problems. SIAM J. on Computing 7 (1978) 178-193
-
(1978)
SIAM J. on Computing
, vol.7
, pp. 178-193
-
-
Frederickson, G.N.1
Hecht, M.S.2
Kim, C.E.3
-
9
-
-
0042174519
-
An approximation algorithm for maximum packing of 3-edge paths
-
Hassin, R., Rubinstein, S.: An Approximation Algorithm for Maximum Packing of 3-Edge Paths. Information Processing Letters 63 (1997) 63-67
-
(1997)
Information Processing Letters
, vol.63
, pp. 63-67
-
-
Hassin, R.1
Rubinstein, S.2
-
10
-
-
26844491363
-
An approximation algorithm for maximum triangle packing
-
ESA
-
Hassin, R., Rubinstein, S.: An Approximation Algorithm for Maximum Triangle Packing. ESA, LNCS 3221 (2004) 403-413
-
(2004)
LNCS
, vol.3221
, pp. 403-413
-
-
Hassin, R.1
Rubinstein, S.2
-
11
-
-
0037097074
-
Differential approximation results for the traveling salesman and related problems
-
Monnot, J.: Differential approximation results for the traveling salesman and related problems. Information Processing Letters 82 (2002) 229-235
-
(2002)
Information Processing Letters
, vol.82
, pp. 229-235
-
-
Monnot, J.1
-
14
-
-
4544278109
-
On the k-path partition of graphs
-
Steiner, G.: On the k-path partition of graphs. Theoretical Computer Science 290 (2003) 2147-2155
-
(2003)
Theoretical Computer Science
, vol.290
, pp. 2147-2155
-
-
Steiner, G.1
|