603 search results - page 36 / 121 » A General Approximation Technique for Constrained Forest Pro... |
116
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
118
click to vote
DAGSTUHL
2007
15 years 2 months ago
2007
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
112
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
127
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
110
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...