๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems

โœ Scribed by Marathe, Madhav V.; Hunt, Harry B.; Stearns, Richard E.; Radhakrishnan, Venkatesh

Book ID
118177444
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
374 KB
Volume
27
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

NC-Approximation Schemes for NP- and PSP
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
โœ Harry B Hunt III; Madhav V Marathe; Venkatesh Radhakrishnan; S.S Ravi; Daniel J ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 303 KB

We present NC-approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs and graphs drawn in a civilized manner. Our approximation schemes exhibit the same time versus performance trade-off as the best known approximation schemes for planar gr

Near-optimal hardness results and approx
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
โœ Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; Bruce Shepherd; Mihali ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 308 KB

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs รฐs i ; t i รž; 1pipk; and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjo