Titlebook: Automata, Languages, and Programming; 39th International C Artur Czumaj,Kurt Mehlhorn,Roger Wattenhofer Conference proceedings 2012 Springe

一起平行

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degreefunction..Finally, we construct a fault-tolerant single-sink spanner with bounded maximum degree, and use it to reduce the maximum degree of our basic .-VFTS. As a result, we get a .-VFTS with .(...) edges and maximum degree .(..).

圆桶

Node-Weighted Network Design in Planar and Minor-Closed Families of Graphsth maximum requirement .. Our result is inspired by, and generalizes, the work of Demaine, Hajiaghayi and Klein [5] who gave constant factor approximation algorithms for node-weighted Steiner tree and Steiner forest problems (and more generally covering 0-1 proper functions) in planar and minor-closed families of graphs.

泄露

overshadow

https://doi.org/10.1007/978-3-8349-9576-6 groups in time, polynomial in the order and simply exponential in the degree; (b) the introduction of the “twisted code equivalence problem,” a generalization of the classical code equivalence problem by admitting a group action on the alphabet. Both of these problems are of independent interest.

Badger

兽皮

Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups groups in time, polynomial in the order and simply exponential in the degree; (b) the introduction of the “twisted code equivalence problem,” a generalization of the classical code equivalence problem by admitting a group action on the alphabet. Both of these problems are of independent interest.

直觉好

EVEN

Anthem

pus840