An approximation algorithm for the pickup and delivery vehicle routing problem on treesKATOH, Naoki; YANO, Taihei.Discrete applied mathematics. 2006, Vol 154, Num 16, pp 2335-2349, issn 0166-218X, 15 p.Conference Paper

A list heuristic for vertex coverAVIS, David; IMAMURA, Tomokazu.Operations research letters. 2007, Vol 35, Num 2, pp 201-204, issn 0167-6377, 4 p.Article

A (1-1/e)-approximation algorithm for the generalized assignment problemNUTOV, Zeev; BENIAMINY, Israel; YUSTER, Raphael et al.Operations research letters. 2006, Vol 34, Num 3, pp 283-288, issn 0167-6377, 6 p.Article

Approximation and online algorithms (Third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005)Erlebach, Thomas; Persinao, Giuseppe.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32207-8, 1Vol, X-347 p, isbn 3-540-32207-8Conference Proceedings

A well-characterized approximation problemHÅSTAD, J; PHILLIPS, S; SAFRA, S et al.Information processing letters. 1993, Vol 47, Num 6, pp 301-305, issn 0020-0190Article

Algorithms - ESA 2005 (13th annual European sympoisum, Palma de Mallorca, Sapin, October 3-6, 2005, proceedings)Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-29118-0, 1Vol, XVIII, 901 p, isbn 3-540-29118-0Conference Proceedings

Improved approximation algorithm for the feedback set problem in a bipartite tournamentSASATTE, Prashant.Operations research letters. 2008, Vol 36, Num 5, pp 602-604, issn 0167-6377, 3 p.Article

A note on the approximability of cutting stock problems : Cutting and PackingCINTRA, G. F; MIYAZAWA, F. K; WAKABAYASHI, Y et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1328-1332, issn 0377-2217, 5 p.Article

On the intercluster distance of a tree metricBANG YE WU.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 136-141, issn 0304-3975, 6 p.Article

Simple linear time approximation algorithm for betweennessMAKARYCHEV, Yury.Operations research letters. 2012, Vol 40, Num 6, pp 450-452, issn 0167-6377, 3 p.Article

Point sets in the unit square and large areas of convex hulls of subsets of pointsLEFMANN, Hanno.Journal of combinatorial optimization. 2008, Vol 16, Num 2, pp 182-195, issn 1382-6905, 14 p.Conference Paper

Approximation of the supply scheduling problemCHAUHAN, Satyaveer S; EREMEEV, Anton V; ROMANOVA, Anna A et al.Operations research letters. 2005, Vol 33, Num 3, pp 249-254, issn 0167-6377, 6 p.Article

An analysis of the LPT algorithm for the max-min and the min-ratio partition problemsBANG YE WU.Theoretical computer science. 2005, Vol 349, Num 3, pp 407-419, issn 0304-3975, 13 p.Article

Approximations for maximum transportation with permutable supply vector and other capacitated star packing problemsARKIN, Esther M; HASSIN, Refael; RUBINSTEIN, Shlomi et al.Algorithmica. 2004, Vol 39, Num 2, pp 175-187, issn 0178-4617, 13 p.Article

Maximum Series-Parallel SubgraphCALINESCU, Gruia; FERNANDES, Cristina G; KAUL, Hemanshu et al.Algorithmica. 2012, Vol 63, Num 1-2, pp 137-157, issn 0178-4617, 21 p.Article

Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l_∞-Fitting Robinson Structures to DistancesCHEPOI, Victor; SESTON, Morgan.Algorithmica. 2011, Vol 59, Num 4, pp 521-568, issn 0178-4617, 48 p.Article

A metric for rooted trees with unlabeled vertices based on nested parenthesesWU, Chan-Shuo; HUANG, Guan-Shieng.Theoretical computer science. 2010, Vol 411, Num 44-46, pp 3923-3931, issn 0304-3975, 9 p.Article

A better differential approximation ratio for symmetric TSPESCOFFIER, Bruno; MONNOT, Jérome.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 63-70, issn 0304-3975, 8 p.Article

Asymmetry in k-center variantsGØRTZ, Inge Li; WIRTH, Anthony.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 188-199, issn 0304-3975, 12 p.Article

Approximating the balanced minimum evolution problemFIORINI, Samuel; JORET, Gwenaël.Operations research letters. 2012, Vol 40, Num 1, pp 31-35, issn 0167-6377, 5 p.Article

An approximation algorithm for the k-Level Concentrator Location ProblemDREXL, Moritz A.Operations research letters. 2011, Vol 39, Num 5, pp 355-358, issn 0167-6377, 4 p.Article

Improved Approximation Algorithms for Label Cover ProblemsCHARIKAR, Moses; HAJIAGHAYI, Mohammadtaghi; KARLOFF, Howard et al.Algorithmica. 2011, Vol 61, Num 1, pp 190-206, issn 0178-4617, 17 p.Article

A note on the integrality gap of an ILP formulation for the periodic maintenance problemGRIGORIEV, Alexander; VAN DE KLUNDERT, Joris.Operations research letters. 2011, Vol 39, Num 4, pp 252-254, issn 0167-6377, 3 p.Article

A note on the subadditive network design problemBATENI, M; HAJIAGHAYI, M.Operations research letters. 2009, Vol 37, Num 5, pp 339-344, issn 0167-6377, 6 p.Article

Semidefinite programming based approaches to the break minimization problemMIYASHIRO, Ryuhei; MATSUI, Tomomi.Computers & operations research. 2006, Vol 33, Num 7, pp 1975-1982, issn 0305-0548, 8 p.Article