External Links

    Journal: Algorithmica

    Volume 30, Issue 3

    351 -- 352Klaus Jansen, José D. P. Rolim. Guest Editors Introduction
    353 -- 375Joseph Cheriyan, Tibor Jordán, Zeev Nutov. On Rooted Node-Connectivity Problems
    376 -- 385Prasad Tetali, Santosh Vempala. Random Sampling of Euler Tours
    386 -- 397Marek Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
    398 -- 405Maxim Sviridenko. Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint
    406 -- 417V. Kumar. An Approximation Algorithm for Circular Arc Colouring
    418 -- 431Michael E. Saks, Shiyu Zhou. Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols
    432 -- 450Guy Kortsarz. On the Hardness of Approximating Spanners
    451 -- 470Christoph Baur, Sándor P. Fekete. Approximation of Geometric Dispersion Problems
    runs on