24 search results - page 4 / 5 » Minimum-Weight Cycle Covers and Their Approximability |
98
Voted
APPROX
2008
Springer
15 years 8 days ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
97
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
98
Voted
MOBICOM
2009
ACM
15 years 4 months ago
2009
ACM
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
APLAS
2009
ACM
15 years 4 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
77
Voted
WINE
2009
Springer
15 years 4 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...