Sciweavers

2698 search results - page 106 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
JMLR
2010
164views more  JMLR 2010»
15 years 1 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
AUSAI
2004
Springer
15 years 11 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
CORR
2011
Springer
268views Education» more  CORR 2011»
14 years 9 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
AAECC
1997
Springer
99views Algorithms» more  AAECC 1997»
15 years 10 months ago
Extension Theorems for Linear Codes over Finite Rings
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
Jay A. Wood
SIGECOM
2003
ACM
92views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Strategyproof cost-sharing mechanisms for set cover and facility location games
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
Nikhil R. Devanur, Milena Mihail, Vijay V. Vaziran...