Sciweavers

1090 search results - page 26 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
SIAMDM
2010
117views more  SIAMDM 2010»
13 years 7 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
CAAN
2006
Springer
14 years 15 days ago
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
Guy Even, Shimon Shahar
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 9 days ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
14 years 3 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde
ATAL
2008
Springer
13 years 10 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan