Sciweavers

14158 search results - page 93 / 2832
» Generalized switch-setting problems
Sort
View
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
14 years 4 months ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan
ECAI
2010
Springer
13 years 8 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
13 years 11 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
COR
2006
96views more  COR 2006»
13 years 10 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
14 years 4 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák