217 search results - page 7 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
102
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
102
click to vote
CGF
2008
14 years 9 months ago
2008
We present a novel approach to parameterize a mesh with disk topology to the plane in a shape-preserving manner. Our key contribution is a local/global algorithm, which combines a...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...