How to Allocate Network Centers

This paper deals with the issue of allocating and utilizing centers in a distributed network, in its various forms. The paper discusses the significant parameters of center allocation, defines the resulting optimization problems, and proposes several approximation algorithms for selecting centers and for distributing the users among them. We concentrate mainly on balanced versions of the problem, i.e., in which it is required that the assignment of clients to centers be as balanced as possible. The main results are constant ratio approximation algorithms for the balanced κ-centers and balanced κ-weighted centers problems, and logarithmic ratio approximation algorithms for the ρ-dominating set and the k-tolerant set problems.     

Strong Unicity of Restricted p-Centers

Given a continuous seminorm p on a separated locally convex linear topological space X, we study in this paper strong uniqueness of the so-called restricted p-centers of sets. First we explore finite extremal characterizations of strongly unique restricted p-centers of subsets of X from its finite dimensional subspaces. Our main goal here is to investigate strong uniqueness of restricted p-centers of certain sets from the so-called p-RS sets, which are defined as closed convex sets that are obtained by imposing convex side constraints arising from boundedness of coefficients on translates of certain subspaces of X.     

Functional equations associated with triangle geometry

Summary Triangle geometry is treated in the context of functional equations of three variablesa, b, c which may be regarded as the sidelengths of a variable triangle. Trianglecenters (e.g., incenter, circumcenter, centroid), andcentral lines (e.g., the Euler line) are defined and partitioned into classes:0-centers, 1-centers, 2-centers and0-lines, 1-lines, and 2-lines. Criteria for parallelism, perpendicularity, and other geometric relations are proved in terms of these classes. The Euler line and central lines parallel or perpendicular to the Euler line serve as examples.     

On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension

The problems under study are connected with the choice of a vector subset from a given finite set of vectors in the Euclidean space ℝ ^k . The sum norm and averaged square of the sumnorm are considered as the target functions (to be maximized). The optimal combinatorial algorithms with time complexity O(k ² n ^2k ) are developed for these problems. Thus, the polynomial solvability of these problems is proved for k fixed.     

Dynamic Coresets

We give a dynamic data structure that can maintain an ε-coreset of n points, with respect to the extent measure, in O(log n) time per update for any constant ε>0 and any constant dimension. The previous method by Agarwal, Har-Peled, and Varadarajan requires polylogarithmic update time. For points with integer coordinates bounded by U, we alternatively get O(log log U) time. Numerous applications follow, for example, on dynamically approximating the width, smallest enclosing cylinder, minimum bounding box, or minimum-width annulus. We can also use the same approach to maintain approximate k-centers in time O(log n) (or O(log log U) if the spread is bounded by U) for any constant k and any constant dimension. For the smallest enclosing cylinder problem, we also show that a constant-factor approximation can be maintained in O(1) randomized amortized time on the word RAM. This work has been supported by NSERC. A preliminary version of this paper has appeared in Proc. 24th ACM Sympos Comput. Geom., 2008.     

Easy and hard bottleneck location problems

We consider a bottleneck location problem on a graph and present an efficient (polynomial time) algorithm for solving it. The problem involve the location of K noxious facilities that are to be placed as far as possilbe from the other facilities, and the objective is to maximize the minimum distance from the noxious facilities to the others. We then show that two other bottleneck (min-max) location problems, finding K-centers and absolute K-centers of a graph appear to be very difficult to solve even for reasonably good approximate solutions.     

Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic

We investigate the definability in monadic ∑₁¹ and monadic Π₁¹ of the problems REG_k, of whether there is a regular subgraph of degree k in some given graph, and XREG_k, of whether, for a given rooted graph, there is a regular subgraph of degree k in which the root has degree k, and their restrictions to graphs in which every vertex has degree at most k, namely REG_k^k and XREG_k^k, respectively, for k ≥ 2 (all our graphs are undirected). Our motivation partly stems from the fact (which we prove here) that REG_k^k and XREG_k^k are logspace equivalent to CONN and REACH, respectively, for k ≥ 3, where CONN is the problem of whether a given graph is connected and REACH is the problem of whether a given graph has a path joining two given vertices. We use monadic first - order reductions, monadic ∑₁¹ games and a recent technique due to Fagin, Stockmeyer and Vardi to almost completely classify whether these problems are definable in monadic ∑₁¹ and monadic Π₁¹, and we compare the definability of these problems (in monadic ∑₁¹ and monadic Π₁¹ with their computational complexity (which varies from solvable using logspace to NP - complete).     

The RH boundary value problem of the k-monogenic functions

In this paper we study the Riemann and Hilbert problems of k-monogenic functions. By using Euler operator, we transform the boundary value problem of k-monogenic functions into the boundary value problems of monogenic functions. Then by the Almansi-type theorem of k-monogenic functions, we get the solutions of these problems.     

On two problems of choosing some subset of vectors with integer coordinates that has maximum norm of the sum of elements in Euclidean space

Under study are the two problems of choosing a subset of m vectors with the maximum norm of the sum of the elements from a set of n vectors in Euclidean space ℝ ^k . The vectors are assumed to have integer coordinates. Using the dynamic programming technique, some new optimal algorithms are suggested for solving the problems; these algorithms have pseudopolynomial time when the dimension of the space is fixed. The new algorithms have certain advantages over the availables: the vector subset problem can be solved faster for m < (k/2) ^k , while, after taking into account an additional restriction on the order of the vectors, the time complexity is k ^k−1 times less independently on m.     

Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

It is known that large fragments of the class of dense Minimum Constraint Satisfaction (MIN‐CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to their Maximum Constraint Satisfaction analogs. In this paper we prove, somewhat surprisingly, that the minimum satisfaction of dense instances of kSAT ‐formulas, and linear equations mod 2, Ek‐LIN2, do have PTASs for any k. The MIN‐Ek‐LIN2 problems are equivalent to the k‐ary versions of the Nearest Codeword problem, the problem which is known to be exceedingly hard to approximate on general instances. The method of solution of the above problems depends on the development of a new density sampling technique for k‐uniform hypergraphs which could be of independent interest. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 73–91, 2003     

Commutator Invariant Subgroups of Abelian Groups

We describe the commutator invariant subgroups of a nonreduced abelian group. We find out when all commutator invariant subgroups of a separable group and an algebraically compact torsion-free group are fully invariant and describe the E-centers and E-commutants of these and some other groups.     

Worst-case time bounds for coloring and satisfiability problems

We consider worst case time bounds for certain NP-complete problems. In particular, we consider the (k,2)-satisfiability problem which includes as special cases some canonical problems such as graph coloring and satisfiability. For the (k,2)-satisfiability problem, we present a randomized algorithm that runs in time O^*((k!)^n/k).² This bound is equivalent to O((k/c_k)ⁿ) with c_k increasing to the asymptotic limit e. For k11, we improve upon the O((0.4518k)ⁿ) randomized bound of Eppstein [Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 329–337]. A special case of (k,2)-satisfiability is k-colorability; here we achieve the above time bound for a slightly larger c_k that has the same asymptotic behavior.     

Fortran codes for computing the discrete Helmholtz integral operators

In this paper Fortran subroutines for the evaluation of the discrete form of the Helmholtz integral operators L _k, M _k, M _k ^t and N _k for two-dimensional, three-dimensional and three-dimensional axisymmetric problems are described. The subroutines are useful in the solution of Helmholtz problems via boundary element and related methods. The subroutines have been designed to be easy to use, reliable and efficient. The subroutines are also flexible in that the quadrature rule is defined as a parameter and the library functions (such as the Hankel, exponential and square root functions) are called from external routines. The subroutines are demonstrated on test problems arising from the solution of the Neumann problem exterior to a closed boundary via the Burton and Miller equation. This revised version was published online in August 2006 with corrections to the Cover Date.     

A common generalization of line graphs and clique graphs

Both the line graph and the clique graph are defined as intersection graphs of certain families of complete subgraphs of a graph. We generalize this concept. By a k-edge of a graph we mean a complete subgraph with k vertices or a clique with fewer than k vertices. The k-edge graph Δ_k(G) of a graph G is defined as the intersection graph of the set of all k-edges of G. The following three problems are investigated for k-edge graphs. The first is the characterization problem. Second, sets of graphs closed under the k-edge graph operator are found. The third problem is the question of convergence: What happens to a graph if we take iterated k-edge graphs?     

Parameterizing above Guaranteed Values: MaxSat and MaxCut

In this paper we investigate the parameterized complexity of the problems MaxSat and MaxCut using the framework developed by Downey and Fellows. LetGbe an arbitrary graph havingnvertices andmedges, and letfbe an arbitrary CNF formula withmclauses onnvariables. We improve Cai and Chen'sO(2^2ckcm) time algorithm for determining if at leastkclauses of ac-CNF formulafcan be satisfied; our algorithm runs inO(|f| + k²φ^k) time for arbitrary formulae and inO(cm + ckφ^k) time forc-CNF formulae, where φ is the golden ratio . We also give an algorithm for finding a cut of size at leastk; our algorithm runs inO(m + n + k4^k) time. We then argue that the standard parameterization of these problems is unsuitable, because nontrivial situations arise only for large parameter values (k ≥ m/2), in which range the fixed-parameter tractable algorithms are infeasible. A more meaningful question in the parameterized setting is to ask whether m/2 + kclauses can be satisfied, or m/2 + kedges can be placed in a cut. We show that these problems remain fixed-parameter tractable even under this parameterization. Furthermore, for up to logarithmic values of the parameter, our algorithms for these versions also run in polynomial time.     

Edge‐disjoint Hamiltonian cycles in hypertournaments

We introduce a method for reducing k‐tournament problems, for k ≥ 3, to ordinary tournaments, that is, 2‐tournaments. It is applied to show that a k‐tournament on n ≥ k + 1 + 24d vertices (when k ≥ 4) or on n ≥ 30d + 2 vertices (when k = 3) has d edge‐disjoint Hamiltonian cycles if and only if it is d‐edge‐connected. Ironically, this is proved by ordinary tournament arguments although it only holds for k ≥ 3. We also characterizatize the pancyclic k‐tournaments, a problem posed by Gutin and Yeo.(Our characterization is slightly incomplete in that we prove it only for n large compared to k.). © 2005 Wiley Periodicals, Inc. J Graph Theory     

On the Homomorphism Order of Labeled Posets

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and infima, and the complexity of certain decision problems involving the homomorphism order of k-posets. Sublattices are also examined.     

Complete reducibility of subgroups of reductive algebraic groups over nonperfect fields III

Let G be a reductive group over a nonperfect field k. We study rationality problems for Serre’s notion of complete reducibility of subgroups of G. In our previous work, we constructed examples of subgroups H of G that are G-completely reducible but not G-completely reducible over k (and vice versa). In this article, we give a theoretical underpinning of those constructions. Then using Geometric Invariant Theory, we obtain a new result on the structure of G(k)-(and G-) orbits in an arbitrary affine G-variety. We discuss several related problems to complement the main results.     

Subgraphs of colour-critical graphs

Some problems and results on the distribution of subgraphs in colour-critical graphs are discussed. In section 3 arbitrarily largek-critical graphs withn vertices are constructed such that, in order to reduce the chromatic number tok−2, at leastc _k n ² edges must be removed. In section 4 it is proved that a 4-critical graph withn vertices contains at mostn triangles. Further it is proved that ak-critical graph which is not a complete graph contains a (k−1)-critical graph which is not a complete graph.     

Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs

Faudree and Schelp conjectured that for any two vertices x, y in a Hamiltonian-connected graph G and for any integer k, where n/2 ? k ? n ? 1, G has a path of length k connecting x and y. However, we show in this paper that there are infinitely many exceptions to this conjecture and we comment on some problems on path length distribution raised by Faudree and Schelp.