3875 search results - page 97 / 775 » Approximation Algorithms for the Max-coloring Problem |
130
click to vote
SODA
1992
ACM
15 years 3 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
142
click to vote
CCE
2005
15 years 2 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
115
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
138
click to vote
ECCC
2011
14 years 9 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
122
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...