Titlebook: Algorithms and Computation; 15th International S Rudolf Fleischer,Gerhard Trippen Conference proceedings 2005 Springer-Verlag Berlin Heidel

Truman

書目名稱Algorithms and Computation影響因子(影響力)




書目名稱Algorithms and Computation影響因子(影響力)學科排名




書目名稱Algorithms and Computation網(wǎng)絡公開度




書目名稱Algorithms and Computation網(wǎng)絡公開度學科排名




書目名稱Algorithms and Computation被引頻次




書目名稱Algorithms and Computation被引頻次學科排名




書目名稱Algorithms and Computation年度引用




書目名稱Algorithms and Computation年度引用學科排名




書目名稱Algorithms and Computation讀者反饋




書目名稱Algorithms and Computation讀者反饋學科排名

類型

Pareto Optimality in House Allocation Problems,or finding a maximum cardinality Pareto optimal matching, where . is the number of agents and . is the total length of the preference lists. By contrast, we show that the problem of finding a minimum cardinality Pareto optimal matching is NP-hard, though approximable within a factor of 2. We then sh

Countermand

Property-Preserving Data Reconstruction,t of sorted numbers, or points on a manifold, or vectors in a polyhedral cone, or codewords from an error-correcting code. Because of noise and errors, however, an (unknown) fraction of the data is deemed ., ie, in violation with the expected structural properties. Can one still query into the datas

刺耳

Indent

Ablation

牢騷

Multicriteria Global Minimum Cuts, has?. non-negative costs associated with it. These costs are measured in separate, non interchangeable, units. In the AND-version of the problem, purchasing an edge requires the payment of . the?. costs associated with it. In the OR-version, an edge can be purchased by paying . of the .-costs assoc

背景

Polyline Fitting of Planar Points Under Min-sum Criteria,tting a polyline with . joints under the min-sum criteria with respect to . .- and . .-metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem, and fully polynomial-time approximat

Cardioversion

A Generalization of Magic Squares with Applications to Digital Halftoning,eneralize this notion to that of a . . . by replacing the requirement that the sum of each row and each column be the same by that of requiring that the sum of the entries in each . × . square contiguous submatrix be the same. We show that such matrices exist if . and . are both even, and do not if

PATHY

Voronoi Diagrams with a Transportation Network on the Euclidean Plane,portation network, the distance is measured as the length of the shortest (time) path. In doing so, we introduce a needle, a generalized Voronoi site. We present an .(. .log . + . .log .) algorithm to compute the Voronoi diagram with a transportation network on the Euclidean plane, where . is the nu