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

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

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

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

A New Approximation Algorithm for Multidimensional Rectangle TilingPALUCH, Katarzyna.Lecture notes in computer science. 2006, pp 712-721, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Homogeneous 2-Hops Broadcast in 2DDAS, Gautam K; DAS, Sandip; NANDY, Subhas C et al.Lecture notes in computer science. 2006, pp 750-759, issn 0302-9743, isbn 3-540-34070-X, 10 p.Conference Paper

Approximating edit distance efficientlyBAR-YOSSEF, Ziv; JAYRAM, T. S; KRAUTHGAMER, Robert et al.Annual Symposium on Foundations of Computer Science. 2004, pp 550-559, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Dynamic algorithms for approximating interdistancesBESPAMYATNIKH, Sergei; SEGAL, Michael.Lecture notes in computer science. 2003, pp 1169-1180, issn 0302-9743, isbn 3-540-40493-7, 12 p.Conference Paper

Approximating rooted connectivity augmentation problemsNUTOV, Zeev.Lecture notes in computer science. 2003, pp 141-152, issn 0302-9743, isbn 3-540-40770-7, 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

A 1.75-approximation algorithm for unsigned translocation distanceYUN CUI; LUSHENG WANG; DARNING ZHU et al.Lecture notes in computer science. 2005, pp 392-401, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Maximizing agreements and CoAgnostic learningBSHOUTY, Nader H; BURROUGHS, Lynn.Lecture notes in computer science. 2002, pp 83-97, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

Maximizing the area of overlap of two unions of disks under rigid motionDE BERG, Mark; CABELLO, Sergio; GIANNOPOULOS, Panos et al.Lecture notes in computer science. 2004, pp 138-149, issn 0302-9743, isbn 3-540-22339-8, 12 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

Multiple objective minimum cost flow problems : A reviewHAMACHER, Horst W; PEDERSEN, Christian Roed; RUZIKA, Stefan et al.European journal of operational research. 2007, Vol 176, Num 3, pp 1404-1422, issn 0377-2217, 19 p.Article