1559 search results - page 265 / 312 » Some Group Theory Problems |
SPAA
2009
ACM
15 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
EWCBR
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Case retrieval is an important problem in several commercially signi cant application areas, such as industrial con guration and manufacturing problems. In this paper we ...
104
click to vote
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
130
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...