115 search results - page 9 / 23 » Hardness and Approximation Results for Packing Steiner Trees |
CC
2006
Springer
14 years 9 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
COCOON
2003
Springer
15 years 2 months ago
2003
Springer
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
SIAMDM
2010
14 years 7 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
CPM
2000
Springer
15 years 1 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
SODA
2001
ACM
14 years 10 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...