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

Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequencesKANG NING; HOONG KEE NG; HON WAI LEONG et al.International journal of data mining and bioinformatics (Print). 2011, Vol 5, Num 6, pp 611-625, issn 1748-5673, 15 p.Article

A PTAS for Cutting Out Polygons with LinesBEREG, Sergey; DAESCU, Ovidiu; MINGHUI JIANG et al.Algorithmica. 2009, Vol 53, Num 2, pp 157-171, issn 0178-4617, 15 p.Article

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

Sweeping PointsDUMITRESCU, Adrian; MINGHUI JIANG.Algorithmica. 2011, Vol 60, Num 3, pp 703-717, issn 0178-4617, 15 p.Article

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

Aggregation of Partial Rankings, p-Ratings and Top-m ListsAILON, Nir.Algorithmica. 2010, Vol 57, Num 2, pp 284-300, issn 0178-4617, 17 p.Article

Minimum-volume enclosing ellipsoids and core setsKUMAR, P; YILDIRIM, E. A.Journal of optimization theory and applications. 2005, Vol 126, Num 1, pp 1-21, issn 0022-3239, 21 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

Object-Oriented Development of an Optimization Software in Java Using Evolution StrategiesREINAUER, Veronika; MAGELE, Christian; SCHEIBLICH, Christian et al.IEEE transactions on magnetics. 2012, Vol 48, Num 2, pp 603-606, issn 0018-9464, 4 p.Conference Paper

Differential approximation of NP-hard problems with equal size feasible solutionsMONNOT, Jérome.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 4, pp 279-297, issn 0399-0559, 19 p.Article

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

Approximating a class of combinatorial problems with rational objective functionCORREA, José R; FERNANDES, Cristina G; WAKABAYASHI, Yoshiko et al.Mathematical programming (Print). 2010, Vol 124, Num 1-2, pp 255-269, issn 0025-5610, 15 p.Conference Paper

A SHORT NOTE ON AN ADVANCE IN ESTIMATING THE WORST-CASE PERFORMANCE RATIO OF THE MPS ALGORITHMPALETTA, Giuseppe; VOCATURO, Francesca.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2198-2203, issn 0895-4801, 6 p.Article

ON MAXIMIZING WELFARE WHEN UTILITY FUNCTIONS ARE SUBADDITIVEFEIGE, Uriel.SIAM journal on computing (Print). 2009, Vol 39, Num 1, pp 122-142, issn 0097-5397, 21 p.Article

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

IMPROVING THE STRETCH FACTOR OF A GEOMETRIC NETWORK BY EDGE AUGMENTATIONFARSHI, Mohammad; GIANNOPOULOS, Panos; GUDMUNDSSON, Joachim et al.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 226-240, issn 0097-5397, 15 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

A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR OPTIMAL 1.5D TERRAIN GUARDINGBEN-MOSHE, Boaz; KATZ, Matthew J; MITCHELL, Joseph S. B et al.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1631-1647, issn 0097-5397, 17 p.Article

A factor ½ approximation algorithm for two-stage stochastic matching problemsNAN KONG; SCHAEFER, Andrew J.European journal of operational research. 2006, Vol 172, Num 3, pp 740-746, issn 0377-2217, 7 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

On the complexity of the κ-customer vehicle routing problemHASSIN, Refael; RUBINSTEIN, Shlomi.Operations research letters. 2005, Vol 33, Num 1, pp 71-76, issn 0167-6377, 6 p.Article

Near-linear time approximation algorithms for curve simplificationAGARWAL, Pankaj K; HAR-PELED, Sariel; MUSTAFA, Nabil H et al.Algorithmica. 2005, Vol 42, Num 3-4, pp 203-219, issn 0178-4617, 17 p.Conference Paper

Algorithms for a network design problem with crossing supermodular demandsMELKONIAN, Vardges; TARDOS, Eva.Networks (New York, NY). 2004, Vol 43, Num 4, pp 256-265, issn 0028-3045, 10 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