Sciweavers

867 search results - page 51 / 174
» The Generalized Maximum Coverage Problem
Sort
View
SPAA
2010
ACM
15 years 2 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
WINE
2010
Springer
189views Economy» more  WINE 2010»
14 years 7 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
IMC
2007
ACM
14 years 11 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 4 months ago
The second harmonic generation case-study as a gateway for es to quantum control problems
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
Ofer M. Shir, Thomas Bäck
DAM
2008
135views more  DAM 2008»
14 years 9 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski