共查询到20条相似文献,搜索用时 31 毫秒
1.
Borodin et al. (Algorithmica 37(4):295–326, 2003) gave a model of greedy-like algorithms for scheduling problems and Angelopoulos and Borodin (Algorithmica 40(4):271–291,
2004) extended their work to facility location and set cover problems. We generalize their model to include other optimization
problems, and apply the generalized framework to graph problems. Our goal is to define an abstract model that captures the
intrinsic power and limitations of greedy algorithms for various graph optimization problems, as Borodin et al. (Algorithmica
37(4):295–326, 2003) did for scheduling. We prove bounds on the approximation ratio achievable by such algorithms for basic graph problems such
as shortest path, weighted vertex cover, Steiner tree, and independent set. For example, we show that, for the shortest path
problem, no algorithm in the FIXED priority model can achieve any approximation ratio (even one dependent on the graph size),
but the well-known Dijkstra’s algorithm is an optimal ADAPTIVE priority algorithm. We also prove that the approximation ratio
for weighted vertex cover achievable by ADAPTIVE priority algorithms is exactly 2. Here, a new lower bound matches the known
upper bounds (Johnson in J. Comput. Syst. Sci. 9(3):256–278, 1974). We give a number of other lower bounds for priority algorithms, as well as a new approximation algorithm for minimum Steiner
tree problem with weights in the interval [1,2].
S. Davis’ research supported by NSF grants CCR-0098197, CCR-0313241, and CCR-0515332. Views expressed are not endorsed by
the NSF.
R. Impagliazzo’s research supported by NSF grant CCR-0098197, CCR-0313241, and CCR-0515332. Views expressed are not endorsed
by the NSF. Some work done while at the Institute for Advanced Study, supported by the State of New Jersey. 相似文献
2.
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether
a mathematical model of the system satisfies a formal specification of this behavior. Many systems of interest are open, in
the sense that their behavior depends on the interaction with their environment. The model checking problem for finite-state
open systems (called module checking) has been intensively studied in the literature. In this paper, we focus on open pushdown systems and we study the related model-checking problem (pushdown module checking, for short) with respect to properties expressed by CTL and CTL
* formulas. We show that pushdown module checking against CTL (resp., CTL
*) is 2Exptime-complete (resp., 3Exptime-complete). Moreover, we prove that for a fixed CTL or CTL
* formula, the problem is Exptime-complete. 相似文献
3.
There is a great deal of research aimed toward the development of temporal logics and model checking algorithms which can be used to verify properties of systems. In this paper, we present a methodology and supporting tools which allow researchers and practitioners to automatically generate model checking algorithms for temporal logics from algebraic specifications. These tools are extensions of algebraic compiler generation tools and are used to specify model checkers as mappings of the form
, where L
s is a temporal logic source language and L
t is a target language representing sets of states of a model M, such that
. The algebraic specifications for a model checker define the logic source language, the target language representing sets of states in a model, and the embedding of the source language into the target language. Since users can modify and extend existing specifications or write original specifications, new model checking algorithms for new temporal logics can be easily and quickly developed; this allows the user more time to experiment with the logic and its model checking algorithm instead of developing its implementation. Here we show how this algebraic framework can be used to specify model checking algorithms for CTL, a real-time CTL, CTL*, and a custom extension called CTL
e that makes use of propositions labeling the edges as well as the nodes of a model. We also show how the target language can be changed to a language of binary decision diagrams to generate symbolic model checkers from algebraic specifications. 相似文献
4.
The notion of ε-kernel was introduced by Agarwal et al. (J. ACM 51:606–635, 2004) to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a subset Q⊆P is an ε-kernel of P if for every slab W containing Q, the expanded slab (1+ε)W contains P. They illustrated the significance of ε-kernel by showing that it yields approximation algorithms for a wide range of geometric optimization problems.
We present a simpler and more practical algorithm for computing the ε-kernel of a set P of points in ℝ
d
. We demonstrate the practicality of our algorithm by showing its empirical performance on various inputs. We then describe
an incremental algorithm for fitting various shapes and use the ideas of our algorithm for computing ε-kernels to analyze the performance of this algorithm. We illustrate the versatility and practicality of this technique by
implementing approximation algorithms for minimum enclosing cylinder, minimum-volume bounding box, and minimum-width annulus.
Finally, we show that ε-kernels can be effectively used to expedite the algorithms for maintaining extents of moving points.
A preliminary version of the paper appeared in Proceedings of the 20th Annual ACM Symposium on Computational Geometry, 2004, pp. 263–272. Research by the first two authors is supported by NSF under grants CCR-00-86013, EIA-98-70724, EIA-01-31905,
and CCR-02-04118, and by a grant from the US–Israel Binational Science Foundation. Research by the fourth author is supported
by NSF CAREER award CCR-0237431. 相似文献
5.
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc.
35th Annual ACM STOC, pp. 365–372, 2003) developed a simple method for a single-source rent-or-buy problem that also yields the best-known approximation ratio for
the problem. We show how to use a variant of this method to develop an approximately budget-balanced and group strategyproof
cost-sharing method for the problem.
The novelty of our approach stems from our obtaining the cost-sharing methods for the rent-or-buy problem by carefully combining
cost-shares for the simpler Steiner tree problem. Our algorithm is conceptually simpler than the previous such cost-sharing
method due to Pál and Tardos (Proc. 44th Annual FOCS, pp. 584–593, 2003), and improves the previously-known approximation factor of 15 to 4.6.
A preliminary version of this work appears in the Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2004. This research was done in part during the IMA Workshop on Network Management and Design at the University of Minnesota, April 2003.
A. Gupta supported in part by an NSF CAREER award CCF-0448095, and by an Alfred P. Sloan Fellowship.
A. Srinivasan supported in part by the National Science Foundation under Grant No. 0208005 and ITR Award CNS-0426683.
Research of é. Tardos supported in part by ONR grant N00014-98-1-0589, and NSF grants CCR-0311333 and CCR-0325453. 相似文献
6.
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another.
It is modeled by a transfer graph, where vertices represent the storage devices, and edges represent data transfers required
between pairs of devices. Each vertex has a non-negative weight, and each edge has a processing time. A vertex completes when
all the edges incident on it complete; the constraint is that two edges incident on the same vertex cannot be processed simultaneously.
The objective is to minimize the sum of weighted completion times of all vertices. Kim (J. Algorithms 55, 42–57, 2005) gave an LP-rounding 3-approximation algorithm when edges have unit processing times. We give a more efficient primal-dual
algorithm that achieves the same approximation guarantee. When edges have arbitrary processing times we give a primal-dual
5.83-approximation algorithm. We also study a variant of the open shop scheduling problem. This is a special case of the data
migration problem in which the transfer graph is bipartite and the objective is to minimize the sum of completion times of
edges. We present a simple algorithm that achieves an approximation ratio of
, thus improving the 1.796-approximation given by Gandhi et al. (ACM Trans. Algorithms 2(1), 116–129, 2006). We show that the analysis of our algorithm is almost tight.
A preliminary version of the paper appeared in the Proceedings of the 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, APPROX 2006.
Research of R. Gandhi partially supported by Rutgers University Research Council Grant.
Research of J. Mestre done at the University of Maryland; supported by NSF Awards CCR-0113192 and CCF-0430650, and the University
of Maryland Dean’s Dissertation Fellowship. 相似文献
7.
We propose a methodology for designing sound and complete proof systems for proving progress properties of parallel programs under various fairness assumptions. Our methodology begins with a branching time temporal logic formula (CTL*) formula that expresses progress under a fairness assumption. The next step obtains an equivalent fixpoint characterization of this CTL* formula in the-calculus. The final step uses the fixpoint characterizations to extract proof systems for proving progress under the fairness constraint. The methodology guarantees that the proof rules so obtained are sound and relatively complete in the sense of Cook. 相似文献
8.
Shoham Shamir Orna Kupferman Eli Shamir 《Electronic Notes in Theoretical Computer Science》2003,39(1):65-78
We study the distinguishing and expressive power of branching temporal logics with bounded nesting depth of path quantifiers. We define the fragments CTL*i and CTLi of CTL* and CTL, where at most i nestings of path quantifiers are allowed. We show that for all i ≥ 1, the logic CTL*i+1 has more distinguishing and expressive power than CTL*i; thus the branching-depth hierarchy is strict. We describe equivalence relations Hi that capture CTL*i: two states in a Kripke structure are Hi-equivalent iff they agree on exactly all CTL*i formulas. While H1 corresponds to trace equivalence, the limit of the sequence H1, H2,… is Milner's bisimulation. These results are not surprising, but they give rise to several interesting observations and problems. In particular, while CTL* and CTL have the same distinguishing power, this is not the case for CTL*i and CTLi. We define the branching depth of a structure as the minimal index i for which Hi+1=Hi. The branching depth indicates on the possibility of using bisimulation instead of trace equivalence (and similarly for simulation and trace containment). We show that the problem of finding the branching depth is PSPACE-complete. 相似文献
9.
Balkrishna Ramkumar Laxmikant V. Kalé 《International journal of parallel programming》1992,21(1):67-107
When two or more literals in the body of a Prolog clause are solved in (AND) parallel, their solutions need to bejoined to compute solutions for the clause. This is often a difficult problem in parallel Prolog systems that exploit OR and independent AND parallelism in Prolog programs. In several AND/OR parallel systems proposed recently, this problem is side-stepped at the cost of unexploited OR parallelism in the program, in part due to the complexity of the backtracking algorithm beneath AND parallel branches. In some cases, the data dependency graphs used by these systems cannot represent all the exploitable indenpendent AND parallelism known at compile time.In this paper, we describe the compile time analysis for an optimizedjoin algorithm for supporting independent AND parallelism in logic programs efficiently without leaving any OR parallelism unexploited. We then discuss how this analysis can be used to yield very efficient runtime behavior. We also discuss problems associated with a tree representation of the search space when arbitrarily complex data dependency graphs are permitted. We describe how these problems can be resolved by mapping the search space onto the data dependency graphs themselves. The algorithm has been implemented in a compiler for parallel Prolog based on the Reduce-OR process model. The algorithm is suitable for the implementation of AND/OR systems on both shared and nonshared memory machines. Performance on benchmark programs exhibiting AND and OR parallelism on one shared memory machine and one message passing machine is presented.This work was supported in part by NSF Grants CCR-87-00988 and CCR-89-02496.A shorter version of this paper appears in theProceedings of NACLP 1990. 相似文献
10.
An edge ranking of a graph is a labeling of the edges using positive integers such that all paths between two edges with the same label contain an intermediate edge with a higher label. An edge ranking isoptimal if the highest label used is as small as possible. The edge-ranking problem has applications in scheduling the manufacture of complex multipart products; it is equivalent to finding the minimum height edge-separator tree. In this paper we give the first polynomial-time algorithm to find anoptimal edge ranking of a tree, placing the problem inP. An interesting feature of the algorithm is an unusual greedy procedure that allows us to narrow an exponential search space down to a polynomial search space containing an optimal solution. AnNC algorithm is presented that finds an optimal edge ranking for trees of constant degree. We also prove that a natural decision problem emerging from our sequential algorithm isP-complete.The research of P. de la Torre was partially supported by NSF Grant CCR-9010445. R. Greenlaw's research was partially supported by NSF Grant CCR-9209184. The research of A. A. Schäffer was partially supported by NSF Grant CCR-9010534.Subsequent to the acceptance of this paper, Zhou and Nishizeki found faster algorithms for optimal edge ranking of trees, first reducing the time toO(n2) [22] and then toO(n logn) [23]. 相似文献
11.
We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan. We give a simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani. Our algorithm uses randomness only during an initialization phase, and from then on runs completely deterministically. It is the first randomized competitive algorithm with this property to beat the deterministic lower bound. We generalize our approach to a model in which access costs are fixed but update costs are scaled by an arbitrary constantd. We prove lower bounds for deterministic list update algorithms and for randomized algorithms against oblivious and adaptive on-line adversaries. In particular, we show that for this problem adaptive on-line and adaptive off-line adversaries are equally powerful.A preliminary version of these results appeared in a joint paper with S. Irani in theProceedings of the 2nd Symposium on Discrete Algorithms, 1991 [17].This research was partially supported by NSF Grants CCR-8808949 and CCR-8958528.This research was partially supported by NSF Grant CCR-9009753.This research was supported in part by the National Science Foundation under Grant CCR-8658139, by DIMACS, a National Science Foundation Science and Technology center, Grant No. NSF-STC88-09648. 相似文献
12.
We present two new algorithms, Arc Length and Peer Count, for choosing a peer uniformly at random from the set of all peers in Chord (Proceedings of the ACM SIGCOMM 2001 Technical
Conference, 2001). We show analytically that, in expectation, both algorithms have latency O(log n) and send O(log n) messages. Moreover, we show empirically that the average latency and message cost of Arc Length is 10.01log n and that the average latency and message cost of Peer Count is 20.02log n. To the best of our knowledge, these two algorithms are the first fully distributed algorithms for choosing a peer uniformly
at random from the set of all peers in a Distributed Hash Table (DHT). Our motivation for studying this problem is threefold:
to enable data collection by statistically rigorous sampling methods; to provide support for randomized, distributed algorithms
over peer-to-peer networks; and to support the creation and maintenance of random links, and thereby offer a simple means
of improving fault-tolerance.
Research of S. Lewis, J. Saia and M. Young was partially supported by NSF grant CCR-0313160 and Sandia University Research
Program grant No. 191445. 相似文献
13.
14.
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rely on the existence of a language in NP with almost everywhere hardness.
In this paper we separate the same NP-completeness notions under a partial bi-immunity hypothesis that is weaker and only yields a language in NP that is hard to solve on most strings. This improves the results
of Lutz and Mayordomo (Theoretical Computer Science, 1996), Ambos-Spies and Bentzien (Journal of Computer and System Sciences, 2000), and Pavan and Selman (Information and Computation, 2004). The proof of this theorem is a significant departure from previous work. We also use this theorem to separate the NP-completeness
notions under a scaled dimension hypothesis on NP.
Part of this research was done while J.M. Hitchcock was visiting the University of Nebraska-Lincoln. Research of J.M. Hitchcock
supported in part by NSF grant CCF-0515313.
Research of A. Pavan supported in part by NSF grants CCR-0344187 and CCF-0430807.
Research of N.V. Vinodchandran supported in part by NSF grant CCF-0430991 and University of Nebraska Layman Award. 相似文献
15.
Xin He 《Algorithmica》1995,13(6):553-572
We present an efficient parallel algorithm for constructing rectangular duals of plane triangular graphs. This problem finds applications in VLSI design and floor-planning problems. No NC algorithm for solving this problem was previously known. The algorithm takesO(log2
n) time withO(n) processors on a CRCW PRAM, wheren is the number of vertices of the graph.This research was supported by NSF Grants CCR-9011214 and CCR-9205982. 相似文献
16.
We present a parallel algorithm for solving the minimum weighted completion time scheduling problem for transitive series parallel graphs. The algorithm takesO(log2
n) time withO(n
3) processors on a CREW PRAM, wheren is the number of vertices of the input graph. This is the first NC algorithm for solving the problem.Research supported in part by NSF Grants CCR-9011214 and CCR-9205982. 相似文献
17.
Mohamed El-Menshawy Jamal Bentahar Warda El Kholy Rachida Dssouli 《Expert systems with applications》2013,40(1):122-138
Although several approaches have been proposed to specify multi-agent commitment-based protocols that capture flexible and rich interactions among autonomous and heterogeneous agents, very few of them synthesize their formal specification and automatic verification in an integrated framework. In this paper, we present a new logic-based language to specify commitment-based protocols, which is derived from ACTL1c, a logic extending CTL1 with modalities to represent and reason about social commitments and their actions. We present a reduction technique that formally transforms the problem of model checking ACTL1c to the problem of model checking GCTL1 (an extension of CTL1 with action formulae). We prove that the reduction technique is sound and we fully implement it on top of the CWB-NC model checker to automatically verify the NetBill protocol, a motivated and specified example in the proposed specification language. We also apply the proposed technique to check the compliance of another protocol: the Contract Net protocol with given properties and report and discuss the obtained results. We finally develop a new symbolic algorithm to perform model checking dedicated to the proposed logic. 相似文献
18.
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds ofO (logn log*
n) time andn
2/logn processors. We generalize this to obtain anO (logn log*
n)-time algorithm usingn
d
/logn processors for solving the problem ind dimensions. We also give a randomized algorithm for the EREW PRAM that constructs an arrangement ofn lines on-line, in which each insertion is done in optimalO (logn) time usingn/logn processors. Our algorithms develop new parallel data structures and new methods for traversing an arrangement.This work was supported by the National Science Foundation, under Grants CCR-8657562 and CCR-8858799, NSF/DARPA under Grant CCR-8907960, and Digital Equipment Corporation. A preliminary version of this paper appeared at the Second Annual ACM Symposium on Parallel Algorithms and Architectures [3]. 相似文献
19.
《Information and Computation》2006,204(7):1023-1044
We show that ECTL+, the classical extension of CTL with fairness properties, is expressively equivalent to BTL2, a natural fragment of the monadic logic of order. BTL2 is the branching-time logic with arbitrary quantification over paths, and where path formulae are restricted to quantifier depth 2 first-order formulae in the monadic logic of order. This result, linking ECTL+ to a natural fragment of the monadic logic of order, provides a characterization that other branching-time logics, e.g., CTL, lack. We then go on to show that ECTL+ and BTL2 are not finitely based (i.e., they cannot be defined by a finite set of temporal modalities) and that their model-checking problems are of the same complexity. 相似文献
20.
H. A. Blair V. W. Marek J. B. Remmel 《Annals of Mathematics and Artificial Intelligence》2008,52(1):81-105
In a previous paper (Blair et al. 2001), the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms
are interpreted as subsets of a given space X. The view of a logic program as a one-step consequence operator along with the concepts of supported and stable model can
be transferred to such situations. In this paper, we show that we can further extend this paradigm by creating a new one-step
consequence operator by composing the old one-step consequence operator with a monotonic idempotent operator (miop) in the
space of all subsets of X, 2
X
. We call this extension set based logic programming. We show that such a set based formalism for logic programming naturally supports a variety of options. For example, if the
underlying space has a topology, one can insist that the new one-step consequence operator always produces a closed set or
always produces an open set. The flexibility inherent in the semantics of set based logic programs is due to both the range
of natural choices available for specifying the semantics of negation, as well as the role of monotonic idempotent operators
(miops) as parameters in the semantics. This leads to a natural type of polymorphism for logic programming, i.e. the same
logic program can produce a variety of outcomes depending on the miop associated with the semantics. We develop a general
framework for set based programming involving miops. Among the applications, we obtain integer-based representations of real
continuous functions as stable models of a set based logic program.
相似文献