scientific article; zbMATH DE number 1330033
From MaRDI portal
Publication:4258216
Recommendations
Cited in
(only showing first 100 items - show all)- Routing to reduce the cost of wavelength conversion
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Fast payment schemes for truthful mechanisms with verification
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- Computing small partial coverings
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Red-blue covering problems and the consecutive ones property
- Algorithms for compact letter displays: comparison and evaluation
- The transportation problem with exclusionary side constraints
- Approximability of minimum AND-circuits
- Minimum weakly fundamental cycle bases are hard to find
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Minimum-weight cycle covers and their approximability
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- The minimum likely column cover problem
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- \((r,p)\)-centroid problems on paths and trees
- Improved parameterized set splitting algorithms: A Probabilistic approach
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics
- A note on submodular set cover on matroids
- Computational complexity in additive hedonic games
- Non-approximability of weighted multiple sequence alignment.
- Domination analysis of combinatorial optimization problems.
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
- Channel assignment on graphs of bounded treewidth
- Algorithms for graphs with small octopus
- On approximability of linear ordering and related NP-optimization problems on graphs.
- Hardness of approximation for non-overlapping local alignments.
- Inapproximability and a polynomially solvable special case of a network improvement problem.
- Some APX-completeness results for cubic graphs
- Approximability of hard combinatorial optimization problems: an introduction
- On bounded occurrence constraint satisfaction
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- The hardness of placing street names in a Manhattan type map
- Theoretical complexity of grid cover problems used in radar applications
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- The k-hop connected dominating set problem: approximation and hardness
- Multiple facility location on a network with linear reliability order of edges
- Time traps in supply chains: is optimal still good enough?
- Domination parameters with number 2: interrelations and algorithmic consequences
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Sparsification and subexponential approximation
- Minimizing worst-case and average-case makespan over scenarios
- The complexity of secure domination problem in graphs
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- Approximate inference in Bayesian networks: parameterized complexity results
- Algorithmic aspects of semitotal domination in graphs
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- On two extensions of equimatchable graphs
- Domination problems with no conflicts
- The quadratic shortest path problem: complexity, approximability, and solution methods
- Complexity of distance paired-domination problem in graphs
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
- Efficient solutions for the far from most string problem
- Data-independent neighborhood functions and strict local optima
- Optimal covering designs: complexity results and new bounds
- On the differential approximation of MIN SET COVER
- Learning local transductions is hard
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- On the approximability of the maximum induced matching problem
- The complexity of base station positioning in cellular networks
- Designing optimally multiplexed SNP genotyping assays
- The complexity of Boolean constraint satisfaction local search problems
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
- Packing triangles in bounded degree graphs.
- On the Hamming distance of constraint satisfaction problems.
- The inapproximability of non-NP-hard optimization problems.
- Logical analysis of data with decomposable structures.
- Differential approximation for optimal satisfiability and related problems
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- On inverse traveling salesman problems
- Hardness of approximation for crossing number
- Dynamic data resolution to improve the tractability of UMTS network planning
- Models and methods for solving the problem of network vulnerability
- Paired-domination problem on distance-hereditary graphs
- Approximation algorithm for the partial set multi-cover problem
- Hardness results and approximation algorithm for total liar's domination in graphs
- Solution methods for the vertex variant of the network system vulnerability analysis problem
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- Inequity aversion pricing over social networks: approximation algorithms and hardness results
- Algorithmic aspects of upper edge domination
- Approximation of the double traveling salesman problem with multiple stacks
- On the complexity of the smallest grammar problem over fixed alphabets
- Probabilistic characterization of random Max r-Sat
- Analyzing unit read-once refutations in difference constraint systems
- Positive influence domination in graphs
- Using the method of conditional expectations to supply an improved starting point for CCLS
- A PCP of proximity for real algebraic polynomials
- Robust regression via error tolerance
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Perfect Italian domination in graphs: complexity and algorithms
- Zeros and approximations of holant polynomials on the complex plane
- On the analysis of optimization problems in arc-dependent networks
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- The generalized definitions of the two-dimensional largest common substructure problems
- Algorithm and hardness results on neighborhood total domination in graphs
- Approximation algorithms for geometric conflict free covering problems
- Global total \(k\)-domination: approximation and hardness results
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 Q4258216)
