681 search results - page 40 / 137 » General Polynomial Time Decomposition Algorithms |
CIKM
2003
Springer
15 years 5 months ago
2003
Springer
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
121
click to vote
CATS
2006
15 years 1 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
80
Voted
PODS
2004
ACM
16 years 20 days ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
125
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
93
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...