Sciweavers

2983 search results - page 15 / 597
» The group marriage problem
Sort
View
FSTTCS
2009
Springer
14 years 2 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
HICSS
1998
IEEE
111views Biometrics» more  HICSS 1998»
13 years 11 months ago
Measuring Disagreement in Groups Facing Limited Choice Problems
Agreement is an important concept in group interaction, both for computermediated and face-to-face groups. This paper presents a measure of disagreement, D, for groups facing limi...
Brian Whitworth, Roy Felton
IJAC
2007
59views more  IJAC 2007»
13 years 7 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
14 years 27 days ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
MP
2010
132views more  MP 2010»
13 years 2 months ago
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
Etienne de Klerk, Renata Sotirov