Sciweavers

1963 search results - page 69 / 393
» The Maximum Solution Problem on Graphs
Sort
View
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 24 days ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 8 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
ICASSP
2011
IEEE
13 years 14 days ago
The grouped two-sided orthogonal Procrustes problem
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
Bryan R. Conroy, Peter J. Ramadge
COMPGEOM
2008
ACM
13 years 10 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...