1933 search results - page 78 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
134
Voted
TON
2010
14 years 10 months ago
2010
Abstract--A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unl...
131
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
184
Voted
OL
2011
14 years 10 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
135
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
128
click to vote
EVOW
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...