112 search results - page 22 / 23 » Constant factor approximation of vertex-cuts in planar graph... |
107
click to vote
PODS
2001
ACM
15 years 9 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
105
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
111
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...