Sciweavers

255 search results - page 31 / 51
» A new upper bound for the bipartite Ramsey problem
Sort
View
SOFSEM
2007
Springer
16 years 6 days ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
ICTCS
2005
Springer
15 years 11 months ago
Faster Deterministic Wakeup in Multiple Access Channels
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
Gianluca De Marco, Marco Pellegrini, Giovanni Sbur...
IJCGA
2006
91views more  IJCGA 2006»
15 years 6 months ago
The Tsp and the Sum of its Marginal Values
This paper introduces a new notion related to the traveling salesperson problem (TSP) -the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal va...
Moshe Dror, Yusin Lee, James B. Orlin, Valentin Po...
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
15 years 8 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
177
Voted
QEST
2007
IEEE
16 years 11 days ago
Stochastic Game Logic
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
Christel Baier, Tomás Brázdil, Marcu...