1933 search results - page 92 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
136
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
121
Voted
AINA
2010
IEEE
15 years 8 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
134
Voted
WINE
2009
Springer
15 years 10 months ago
2009
Springer
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
156
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
130
Voted
JCO
1998
15 years 3 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...