142 search results - page 9 / 29 » Approximate maximum weight branchings |
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
WG
2007
Springer
15 years 3 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
ATMOS
2010
14 years 8 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
111
click to vote
PDCAT
2005
Springer
15 years 3 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 ...
102
click to vote
FOCS
2008
IEEE
15 years 4 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...