455 search results - page 79 / 91 » Approximation Algorithms for Partial Covering Problems |
196
Voted
ICALP
2011
Springer
14 years 9 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...
184
Voted
ALGORITHMICA
2011
15 years 26 days ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
234
Voted
CANS
2011
Springer
14 years 5 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
188
click to vote
INFOCOM
2007
IEEE
16 years 3 days ago
2007
IEEE
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
127
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...