Sciweavers

5595 search results - page 191 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 7 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ICTAI
2007
IEEE
16 years 11 days ago
Conceptual Clustering Categorical Data with Uncertainty
Many real datasets have uncertain categorical attribute values that are only approximately measured or imputed. Uncertainty in categorical data is commonplace in many applications...
Yuni Xia, Bowei Xi
138
Voted
ICDCS
2010
IEEE
15 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
CSE
2008
IEEE
15 years 7 months ago
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
Subhas Kumar Ghosh
ICALP
2000
Springer
15 years 9 months ago
Parallel Machine Scheduling Problems with Controllable Processing Times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
Klaus Jansen, Monaldo Mastrolilli