Sciweavers

524 search results - page 36 / 105
» ets 2010
Sort
View
DCG
2010
84views more  DCG 2010»
13 years 7 months ago
On Lines and Joints
Let L be a set of n lines in Rd , for d 3. A joint of L is a point incident to at least d lines of L, not all in a common hyperplane. Using a very simple algebraic proof techniqu...
Haim Kaplan, Micha Sharir, Eugenii Shustin
DM
2010
83views more  DM 2010»
13 years 7 months ago
Polychromatic colorings of arbitrary rectangular partitions
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
Dániel Gerbner, Balázs Keszegh, Nath...
ECCC
2010
79views more  ECCC 2010»
13 years 7 months ago
IP = PSPACE using Error Correcting Codes
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
Or Meir
ENDM
2010
110views more  ENDM 2010»
13 years 7 months ago
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
Ivana Ljubic, Stefan Gollowitzer
EOR
2010
116views more  EOR 2010»
13 years 7 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...