1542 search results - page 68 / 309 » Kernelization of packing problems |
159
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
131
click to vote
ASPDAC
2009
ACM
16 years 20 days ago
2009
ACM
— The enhanced packing densities facilitated by 3D integrated circuit technology also has an unwanted side-effect, in the form of increasing the amount of current per unit footpr...
121
click to vote
UIC
2007
Springer
16 years 8 days ago
2007
Springer
Surface-embedded passive radio frequency (PRF) exteroception is a method whereby an action to be executed by a mobile unit is selected through a signal received from a surface-embe...
131
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
151
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...