Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Management of disk space with REBATE
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Automated Meta-Control for Adaptable Real-Time Software
Real-Time Systems
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of designing optimal partial-match retrieval systems
ACM Transactions on Database Systems (TODS)
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
P-Complete Approximation Problems
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Approximation Algorithms for Some Postman Problems
Journal of the ACM (JACM)
Polynomial-Time Aggregation of Integer Programming Problems
Journal of the ACM (JACM)
Computing the median with uncertainty
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling a pipelined operator graph
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
K-pair delay constrained minimum cost routing in undirected networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Optimizing a mail-order with discount and shipping costs
Information Processing Letters
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Data Mining and Knowledge Discovery
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
Journal of Heuristics
Efficient approximation algorithms for the subset-sums equality problem
Journal of Computer and System Sciences
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
An FPTAS for Agreeably Weighted Variance on a Single Machine
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Computing Shortest Paths with Uncertainty
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Implementation of a PTAS for Scheduling with Release Dates
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Polynominal time approximation schemes for class-constrained packing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
An efficient fully polynomial approximation scheme for the Subset-Sum problem
Journal of Computer and System Sciences
Stochastic Load Balancing and Related Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
ACM '78 Proceedings of the 1978 annual conference
An algorithm for selection of migration candidates
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
A PTAS for weight constrained Steiner trees in series-parallel graphs
Theoretical Computer Science
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Theoretical Computer Science
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Profit-driven uniprocessor scheduling with energy and timing constraints
Proceedings of the 2004 ACM symposium on Applied computing
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Performance bounds of algorithms for scheduling advertisements on a web page
Journal of Scheduling
A post-compiler approach to scratchpad mapping of code
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Web Intelligence and Agent Systems
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Approximation schemes for knapsack problems with shelf divisions
Theoretical Computer Science
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Computing equilibria for a service provider game with (Im)perfect information
ACM Transactions on Algorithms (TALG)
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Dynamics of bid optimization in online advertisement auctions
Proceedings of the 16th international conference on World Wide Web
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
On the complexity of working set selection
Theoretical Computer Science
Approximate and online multi-issue negotiation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
An overlay network for replica placement within a P2P VoD network
International Journal of High Performance Computing and Networking
A collaborative wireless access to on-demand services
Advances in Multimedia
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Automation and Remote Control
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Length-Lex Bounds Consistency for Knapsack Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Note: FPTAS for half-products minimization with scheduling applications
Discrete Applied Mathematics
Combinatorial dominance guarantees for problems with infeasible solutions
ACM Transactions on Algorithms (TALG)
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximated consistency for the automatic recording constraint
Computers and Operations Research
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Designing Patterns and Profiles for Faster HMM Search
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Partitioning graphs of supply and demand
Discrete Applied Mathematics
Exponential-time approximation of weighted set cover
Information Processing Letters
Integrated Production and Delivery Scheduling with Disjoint Windows
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Optimal scheduling of contract algorithms for anytime problems
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Approximation algorithms for orthogonal packing problems for hypercubes
Theoretical Computer Science
Selecting highly optimal architectural feature sets with Filtered Cartesian Flattening
Journal of Systems and Software
A note on graph balancing problems with restrictions
Information Processing Letters
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
On the complexity of variations of equal sum subsets
Nordic Journal of Computing
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
A fair optimization scheduling scheme for IEEE 802.16 networks in multimedia applications
Journal of Visual Communication and Image Representation
A framework for testing DBMS features
The VLDB Journal — The International Journal on Very Large Data Bases
Playing monotone games to understand learning behaviors
Theoretical Computer Science
Capacitated domination problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximation algorithms for scheduling with reservations
HiPC'07 Proceedings of the 14th international conference on High performance computing
Approximation algorithms for traffic grooming in WDM rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Bandwidth allocation in cellular networks with multiple interferences
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Near optimal objects packing through dimensional unfolding
IAAI'96 Proceedings of the eighth annual conference on Innovative applications of artificial intelligence
Breaking out of the box of recommendations: from items to packages
Proceedings of the fourth ACM conference on Recommender systems
Reoptimizing the 0-1 knapsack problem
Discrete Applied Mathematics
Online removable knapsack with limited cuts
Theoretical Computer Science
On the complexity of searching in trees: average-case minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
O((log n)2) time online approximation schemes for bin packing and subset sum problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Diameter-constrained steiner tree
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Knapsack problem with probability constraints
Journal of Global Optimization
A job-shop problem with one additional resource type
Journal of Scheduling
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Clique clustering yields a PTAS for max-coloring interval graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximation algorithms for a bi-level knapsack problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
PTAS for densest k-subgraph in interval graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Resource allocation for covering time varying demands
ESA'11 Proceedings of the 19th European conference on Algorithms
Algorithmic aspects of risk management
Formal modeling
An incremental model for combinatorial maximization problems
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
A universally-truthful approximation scheme for multi-unit auctions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Journal of Discrete Algorithms
Interval subset sum and uniform-price auction clearing
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Conservative computations in energy–based p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Power-saving scheduling for weakly dynamic voltage scaling devices
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Vector bin packing with multiple-choice
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Online minimization knapsack problem
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Approximability of partitioning graphs with supply and demand
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The 1-neighbour knapsack problem
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
SocialClouds: concept, security architecture and some mechanisms
INTRUST'09 Proceedings of the First international conference on Trusted Systems
Cut problems in graphs with a budget constraint
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Universal sequencing on a single machine
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Optimization, randomized approximability, and boolean constraint satisfaction problems
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computing knapsack solutions with cardinality robustness
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Vector bin packing with multiple-choice
Discrete Applied Mathematics
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms (TALG)
Optimization over integers with robustness in cost and few constraints
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Scheduling a two-stage flowshop under makespan constraint
Mathematical and Computer Modelling: An International Journal
Approximate formulations for 0-1 knapsack sets
Operations Research Letters
Design of survivable WDM networks for carrying ATM traffic
Computer Communications
An approximation scheme for the two-stage, two-dimensional knapsack problem
Discrete Optimization
Algorithms for the bounded set-up knapsack problem
Discrete Optimization
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
Discrete Optimization
A total-value greedy heuristic for the integer knapsack problem
Operations Research Letters
Approximation algorithms for the capacitated plant allocation problem
Operations Research Letters
Operations Research Letters
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
Operations Research Letters
On the two-dimensional Knapsack Problem
Operations Research Letters
Approximation of the supply scheduling problem
Operations Research Letters
The quadratic 0-1 knapsack problem with series-parallel support
Operations Research Letters
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
Scheduling of pipelined operator graphs
Journal of Scheduling
Constant-Time approximation algorithms for the knapsack problem
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Randomized mechanisms for multi-unit auctions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The knapsack problem with neighbour constraints
Journal of Discrete Algorithms
Reducing a target interval to a few exact queries
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Priority algorithms for the subset-sum problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Proceedings of the 21st ACM international conference on Information and knowledge management
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
Approximating multi-objective scheduling problems
Computers and Operations Research
Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem
Applied Soft Computing
Job-shop scheduling in a body shop
Journal of Scheduling
Bounded parallel-batching scheduling with two competing agents
Journal of Scheduling
Bin covering with cardinality constraints
Discrete Applied Mathematics
Approximation algorithms for a bi-level knapsack problem
Theoretical Computer Science
Simple FPTAS for the subset-sums ratio problem
Information Processing Letters
Lift-and-Project methods for set cover and knapsack
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
Towards practical private processing of database queries over public data
Distributed and Parallel Databases
Comparing Problem Solving Strategies for NP-hard Optimization Problems
Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications
| Hi-index | 0.02 |