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

Approximation algorithms for orienting mixed graphs

โœ Scribed by Elberfeld, Michael; Segev, Danny; Davidson, Colin R.; Silverbush, Dana; Sharan, Roded

Book ID
118222543
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
329 KB
Volume
483
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation Algorithms for Independent
Approximation Algorithms for Independent Sets in Map Graphs
โœ Zhi-Zhong Chen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 172 KB

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, then a ratio of 1 + ฮด can be achieved by a quadratic-time algorithm for any given con

Approximation algorithms for time-depend
Approximation algorithms for time-dependent orienteering
โœ Fedor V. Fomin; Andrzej Lingas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 73 KB

The time-dependent orienteering problem is dual to the time-dependent traveling salesman problem. It consists of visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time. For any ฮต > 0, we provide a (2 + ฮต)-approxi