Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Journal of Experimental Algorithmics (JEA)
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Wavelength management in WDM rings to maximize the number of connections
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Throughput maximization for periodic packet routing on trees and grids
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
GreedyMAX-type algorithms for the maximum independent set problem
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Cover-decomposition and polychromatic numbers
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximation strategies for routing edge disjoint paths in complete graphs
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Wavelength assignment for satisfying maximal number of requests in all-optical networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
New bounds on the competitiveness of randomized online call control in cellular networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Parameterized maximum path coloring
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized maximum path coloring
Theoretical Computer Science
| Hi-index | 0.00 |
A bidirected tree is the directed graph obtained from an undirected tree by replacing each undirected edge by two directed edges with opposite directions. Given a set of directed paths in a bidirected tree, the goal of the maximum edge-disjoint paths problem is to select a maximum-cardinality subset of the paths such that the selected paths are edge-disjoint. This problem can be solved optimally in polynomial time for bidirected trees of constant degree but is APX-hard for bidirected trees of arbitrary degree. For every fixed $\varepsilon 0$, a polynomial-time $(5/3+\varepsilon)$-approximation algorithm is presented.