Sciweavers

653 search results - page 42 / 131
» The size of minimum 3-trees
Sort
View
DAM
2008
93views more  DAM 2008»
14 years 12 months ago
Planar graph bipartization in linear time
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian...
MOR
2006
123views more  MOR 2006»
14 years 11 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...
JCT
2007
85views more  JCT 2007»
14 years 11 months ago
Separating systems and oriented graphs of diameter two
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
Béla Bollobás, Alex D. Scott
HAPTICS
2007
IEEE
15 years 6 months ago
JND Analysis of Texture Roughness Perception using a Magnetic Levitation Haptic Device
This paper describes the use of a magnetic levitation haptic device (MLHD) to study the psychophysics of texture roughness. Studies of texture roughness perception performed using...
Bertram Unger, Ralph L. Hollis, Roberta L. Klatzky
INFOCOM
2005
IEEE
15 years 5 months ago
Routing in ad hoc networks: a theoretical framework with practical implications
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
Nianjun Zhou, Alhussein A. Abouzeid