6740 search results - page 1024 / 1348 » An s -Hamiltonian Line Graph Problem |
215
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
174
click to vote
TCC
2007
Springer
16 years 27 days ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
187
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
170
click to vote
SODA
1992
ACM
15 years 8 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
164
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
One of the key factors for the success of recent energy
minimization methods is that they seek to compute global
solutions. Even for non-convex energy functionals, optimization
...