676 search results - page 7 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
112
click to vote
NETWORKS
2006
14 years 11 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
118
click to vote
FOCS
2008
IEEE
15 years 23 days ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
CPM
2005
Springer
15 years 5 months ago
2005
Springer
