The following pages link to (Q4258216):
Displaying 50 items.
- Flow shop non-idle scheduling and resource-constrained scheduling (Q271983) (← links)
- A bilevel planning model for public-private partnership (Q276164) (← links)
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Sharp spectral bounds of several graph parameters using eigenvector norms (Q286136) (← links)
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- On the approximability of two tree drawing conventions (Q294876) (← links)
- Computational social choice for coordination in agent networks (Q314440) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- Intractability and the use of heuristics in psychological explanations (Q383037) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- On the aggregation problem for synthesized web services (Q389232) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- Repairing XML functional dependency violations (Q424778) (← links)
- Routing multi-class traffic flows in the plane (Q427052) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Multi-criteria TSP: Min and Max combined (Q433836) (← links)
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- Mapping pipeline skeletons onto heterogeneous platforms (Q436791) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Notes on inverse bin-packing problems (Q458387) (← links)
- Graph clustering (Q458448) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Bilevel competitive facility location and pricing problems (Q463381) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- Flexible-attribute problems (Q616800) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Composing medical crews with equity and efficiency (Q623772) (← links)
