Sciweavers

2516 search results - page 504 / 504
» Integrity Constraints for XML
Sort
View
ECCC
2007
147views more  ECCC 2007»
13 years 5 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...