182 search results - page 29 / 37 » Extremal Problems For Transversals In Graphs With Bounded De... |
ESA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
113
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
130
click to vote
PDCAT
2005
Springer
15 years 5 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
PODC
2009
ACM
16 years 7 days ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
118
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...