572 search results - page 66 / 115 » Exponential-Time Approximation of Hard Problems |
427
click to vote
COCOON
2011
Springer
14 years 6 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
194
Voted
TSP
2012
14 years 1 months ago
2012
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
150
click to vote
GD
2007
Springer
16 years 15 days ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
163
click to vote
MFCS
2007
Springer
16 years 14 days ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
168
click to vote
CGVR
2006
15 years 7 months ago
2006
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...