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

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

A simple linear time (1 + ε)-approximation algorithm for k-means clustering in any dimensionsKUMAR, Amit; SABHARWAL, Yogish; SEN, Sandeep et al.Annual Symposium on Foundations of Computer Science. 2004, pp 454-462, isbn 0-7695-2228-9, 1Vol, 9 p.Conference Paper

Shelf algorithms for two-dimensional packing problemsBAKER, B. S; SCHWARZ, J. S.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 508-525, issn 0097-5397Article

Approximation, randomization, and combinatorial optimization (algorithms and techniques)Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38044-2, 1Vol, XII-522 p, isbn 3-540-38044-2Conference Proceedings

Approximation Scheme for Lowest Outdegree Orientation and Graph Density MeasuresKOWALIK, Lukasz.Lecture notes in computer science. 2006, pp 557-566, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Is constraint satisfaction over two variables always easy?ENGEBRETSEN, Lars; GURUSWAMI, Venkatesan.Lecture notes in computer science. 2002, pp 224-238, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

A (2 - c log N/N): Approximation algorithm for the stable marriage problemIWAMA, Kazuo; MIYAZAKI, Shuichi; OKAMOTO, Kazuya et al.Lecture notes in computer science. 2004, pp 349-361, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

Parameterized complexity: The main ideas and connections to practical computingFELLOWS, Michael R.Lecture notes in computer science. 2002, pp 51-77, issn 0302-9743, isbn 3-540-00346-0, 27 p.Conference Paper

Approximating the minimum maximal independence numberHALLDORSSON, M. M.Information processing letters. 1993, Vol 46, Num 4, pp 169-172, issn 0020-0190Article

The santa claus problemBANSAL, Nikhil; SVIRIDENKO, Maxim.Annual ACM symposium on theory of computing. 2006, pp 31-40, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper

Rectilinear approximation of a set of points in the planeMAYSTER, Yan; LOPEZ, Mario A.Lecture notes in computer science. 2006, pp 715-726, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Approximation, randomization, and combinatorial optimization (algorithms and techniques)Jansen, Klaus; Khanna, Sanjeev; Rolim, José D.P et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22894-2, IX, 428 p, isbn 3-540-22894-2Conference Proceedings

APPROX 2002 : approximation algorithms for combinatorial optimization (Rome, 17-21 September 2002)Jansen, Klaus; Leonardi, Stefano; Vazirani, Vijay et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-44186-7, VIII, 269 p, isbn 3-540-44186-7Conference Proceedings

Approximation algorithms for spreading pointsCABELLO, Sergio.Journal of algorithms (Print). 2007, Vol 62, Num 2, pp 49-73, issn 0196-6774, 25 p.Article

Approximation algorithms for capacitated rectangle stabbingEVEN, Guy; RAWITZ, Dror; SHAHAR, Shimon et al.Lecture notes in computer science. 2006, pp 18-29, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Approximate guarding of monotone and rectilinear polygonsNILSSON, Bengt J.Lecture notes in computer science. 2005, pp 1362-1373, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

Fast algorithms for approximately counting mismatchesKARLOFF, H.Information processing letters. 1993, Vol 48, Num 2, pp 53-60, issn 0020-0190Article

Exponential Inapproximability of Selecting a Maximum Volume Sub-matrixCIVRIL, Ali; MAGDON-ISMAIL, Malik.Algorithmica. 2013, Vol 65, Num 1, pp 159-176, issn 0178-4617, 18 p.Article

Approximating the number of zeroes of a GF [2] polynomialKARPINSKI, M; LUBY, M.Journal of algorithms (Print). 1993, Vol 14, Num 2, pp 280-287, issn 0196-6774Article

Efficient approximation and online algorithms (recent progress on classical combinatorial optimization problems and new applications)Bampis, Evripidis; Jansen, Klaus; Kenyon, Claire et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32212-4, 1Vol, VI-347 p, isbn 3-540-32212-4Book

Covering rectilinear polygons with axis-parallel rectanglesKUMAR, V. S; RAMESH, H.SIAM journal on computing (Print). 2003, Vol 32, Num 6, pp 1509-1541, issn 0097-5397, 33 p.Article

The single-sink buy-at-bulk LP has constant integrality gapTALWAR, Kunal.Lecture notes in computer science. 2002, pp 475-486, issn 0302-9743, isbn 3-540-43676-6, 12 p.Conference Paper

Improved approximation algorithms for MAX NAE-SAT and MAX SATAVIDOR, Adi; BERKOVITCH, Ido; ZWICK, Uri et al.Lecture notes in computer science. 2006, pp 27-40, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Two-Server Network Disconnection ProblemCHOI, Byung-Cheon; HONG, Sung-Pil.Lecture notes in computer science. 2006, pp 785-792, issn 0302-9743, isbn 3-540-34070-X, 8 p.Conference Paper