scientific article; zbMATH DE number 3639144
From MaRDI portal
Publication:4198056
partitionscomputational complexitygraph theorymathematical programmingapproximation algorithmsNP-completenessschedulingalgebraautomatalogicnetwork designgamesnumber theorysequencingstorageprogram optimizationretrievalpuzzleslanguagespolynomial solvable problems
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Game theory (91A99) Artificial intelligence (68T99) Combinatorial aspects of partitions of integers (05A17) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99) Applications of design theory to circuits and networks (94C30) Complexity of computation (including implicit computational complexity) (03D15) Mathematical programming (90C99)
Cited in
(only showing first 100 items - show all)- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- Cost minimization in wireless networks with a bounded and unbounded number of interfaces
- On the restricted forwarding index problem in communication networks
- The complexity of computational problems about Nash equilibria in symmetric win-lose games
- Approximability of the Subset Sum Reconfiguration Problem
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
- The time complexity of permutation routing via matching, token swapping and a variant
- A distributed algorithm for k-dominating sets
- Exact algorithms and applications for tree-like Weighted Set Cover
- Polynomial time approximation schemes and parameterized complexity
- Constrained Steiner trees in Halin graphs
- Disjoint (s, t)‐cuts in a network
- On the complexity of cover-incomparability graphs of posets
- A relax-and-cut algorithm for the set partitioning problem
- On the outer independent double Roman domination number
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Multivariate algorithmics for finding cohesive subnetworks
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- Resource Allocation Systems: Some Complexity Results on the S4PR Class
- On the complexity of typechecking top-down XML transformations
- Mechanisms for dual-role-facility location games: truthfulness and approximability
- Bilevel optimization: reformulation and first optimality conditions
- A theory of requirements capture and its applications
- Easy NP-hardness Proofs of Some Subset Choice Problems
- Liar's domination in unit disk graphs
- Pickup and delivery problem with time windows: a new compact two-index formulation
- Updated estimates for algorithms for packing 2-bar charts in a strip
- On polynomial time one-truth-table reducibility to a sparse set
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- Bounded-degree minimum-radius spanning trees in wireless sensor networks
- On minimum cost edge searching
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- The complexity of the stamp folding problem
- On the approximability of the link building problem
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
- Optimizing tree and character compatibility across several phylogenetic trees
- Kernel bounds for path and cycle problems
- Parameterized complexity of vertex deletion into perfect graph classes
- A decomposition method for CNF minimality proofs
- Optimal time data gathering in wireless networks with multidirectional antennas
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
- Maximum matching in multi-interface networks
- Reducing price of anarchy of selfish task allocation with more selfishness
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Combinatorial and geometric properties of the max-cut and min-cut problems
- Majorization for partially ordered sets
- Multitask n-vehicle exploration problem: complexity and algorithm
- The \(p\)-hub center allocation problem
- Complexity and approximability of quantified and stochastic constraint satisfaction problems
- Biclique completion problems for multicast network design
- Maximizing throughput in queueing networks with limited flexibility
- On independent sets and bicliques in graphs
- Two approaches to determining similarity of two digraphs
- Computing the maximum agreement of phylogenetic networks
- Efficient web searching using temporal factors
- White, Gray and Black Operational Holes : An Artificial Intelligence Approach
- Some NP-complete problems in linear programming
- On colourability of polygon visibility graphs
- Complexity of the Packing Coloring Problem for Trees
- Reducing the hierarchical network design problem
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- Models and linearizations for the Traveling Car Renter with passengers
- Product assortment and space allocation strategies to attract loyal and non-loyal customers
- Symmetric matroid polytopes and their generation
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
- A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
- Backbone analysis and algorithm design for the quadratic assignment problem
- An assertion concerning functionally complete algebras and NP-completeness
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Parameterized algorithms for weighted matching and packing problems
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
- Single-machine multi-agent scheduling problems with a global objective function
- Recent results on well-balanced orientations
- Windows scheduling of arbitrary-length jobs on multiple machines
- Enumerating minimal solution sets for metric graph problems
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- Partitioning vertices into in- and out-dominating sets in digraphs
- Single-machine scheduling with multi-agents to minimize total weighted late work
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- Data science applications to string theory
- A Polynomial Time Market Mechanism
- A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
- Integer programming models and metaheuristics for customer order scheduling
- Bandwidth contrained NP-complete problems
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Counting and enumeration complexity with application to multicriteria scheduling
- On the vertex arboricity of planar graphs of diameter two
- Games for complexity of second-order call-by-name programs
- A graph approximation heuristic for the vertex cover problem on planar graphs
- An Algorithm for SAT Without an Extraction Phase
- Fibres and ordered set coloring
- Traveling salesman problem under categorization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198056)
