Titlebook: Algorithm Theory – SWAT 2008; 11th Scandinavian Wo Joachim Gudmundsson Conference proceedings 2008 The Editor(s) (if applicable) and The Au

經(jīng)典

公豬

flaggy

Bounded Unpopularity Matchingsle to jobs? Here we consider the notion of .. A matching . is popular if there is no matching .′ such that more people prefer .′ to . than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied in [2]. If there is no popular matching

約會(huì)

粘土

On the Redundancy of Succinct Data Structuresproblem of representing binary sequences and strings succinctly using small redundancy. We improve the redundancy required to support the important operations of . and . efficiently for binary sequences and for strings over small alphabets. We also show optimal . upper and lower bounds on the redund

裁決

凹槽

GILD

粗糙

Batch Coloring Flat Graphs and Thintraints or conflicts between the jobs, we need to ensure that jobs in the same batch be non-conflicting. That is, we seek a coloring of the conflict graph. The two most common objectives of schedules and colorings are the makespan, or the maximum job completion time, and the sum of job completion ti

變量

https://doi.org/10.1007/978-3-531-19833-0 of complex parallel computations, by ensuring that two runs of a program that reach the same logical state reach the same physical state, even if various parallel processes executed in different orders during the two runs.