Sciweavers

2266 search results - page 78 / 454
» Some Solutions to the Ignoring Problem
Sort
View
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
15 years 7 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
15 years 6 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
CP
2003
Springer
15 years 6 months ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
ACISP
2010
Springer
15 years 3 months ago
Solving Generalized Small Inverse Problems
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
Noboru Kunihiro
CORR
2004
Springer
113views Education» more  CORR 2004»
15 years 1 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers