Sciweavers

681 search results - page 65 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
107
Voted
CSL
2010
Springer
15 years 1 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
95
Voted
DAM
2008
78views more  DAM 2008»
15 years 16 days ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
100
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 23 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
RECOMB
2007
Springer
16 years 23 days ago
Rearrangements in Genomes with Centromeres Part I: Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromere...
Michal Ozery-Flato, Ron Shamir
110
Voted
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
15 years 1 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh